Login / Signup

On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.

József BaloghPeter KeevashBenny Sudakov
Published in: J. Comb. Theory, Ser. B (2006)
Keyphrases
  • graph model
  • data structure
  • bipartite graph
  • graph partitioning
  • knowledge base
  • real valued
  • rough sets
  • graph databases
  • random graphs
  • frequent subgraph mining