On the minimum degree forcing F-free graphs to be (nearly) bipartite.

Tomasz Luczak Miklós Simonovits

Published in: Discret. Math. (2008)

Keyphrases

graph model
bipartite graph
graph partitioning
undirected graph
random graphs
graph clustering
graph matching
graph representation
real valued
graph theory
graph databases
subgraph isomorphism
power law
weighted graph
directed graph
case study
minimum cost
graph structure
graph theoretic
lower bound
database