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

DOI10.1016/S0095-8956(03)00075-3zbMath1033.05042MaRDI QIDQ1425108

Peter Keevash, Benjamin Sudakov

Publication date: 15 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Turán numberedge-color-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Extremal graphs for edge blow-up of graphs, Graphs with large maximum degree containing no edge-critical graphs, Extremal graphs for odd wheels, Edges Not Covered by Monochromatic Bipartite Graph, Turán number for odd‐ballooning of trees, Edges not in any monochromatic copy of a fixed graph, Extremal problems and results related to Gallai-colorings, On edges not in monochromatic copies of a fixed bipartite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique covering of graphs
• Some recent problems and results in graph theory
• Graph products and monochromatic multiplicities
• Packing triangles in a graph and its complement
• On Sets of Acquaintances and Strangers at any Party
• On the structure of linear graphs
• Edge disjoint monochromatic triangles in 2-colored graphs