On the number of edges not covered by monochromatic copies of a fixed graph.

Peter Keevash Benny Sudakov

Published in: J. Comb. Theory, Ser. B (2004)

Keyphrases

fixed number
random walk
undirected graph
small number
multiscale
data structure
computational complexity
bipartite graph
weighted graph
graph model
spanning tree
maximum number