Edges Not Covered by Monochromatic Bipartite Graph

DOI10.1137/22m1530781zbMath1525.05060arXiv2210.11037MaRDI QIDQ6081803

Kitti Varga, Zhen He, Casey Tompkins, Zequn Lv, Nika Salia, Xiutao Zhu, Ervin Gyoeri

Publication date: 26 October 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.11037

zbMATH Keywords

Ramsey numbercoloringmonochromatic subgraphextremal number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Generalizations of some Nordhaus–Gaddum‐type results on spectral radius

Cites Work

• Unnamed Item
• On edges not in monochromatic copies of a fixed bipartite graph
• Clique covering of graphs
• Some recent problems and results in graph theory
• Graph products and monochromatic multiplicities
• On the number of edges not covered by monochromatic copies of a fixed graph.
• Edges not in any monochromatic copy of a fixed graph
• Path Ramsey numbers in multicolorings
• Extremal graphs for edge blow-up of graphs
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On Sets of Acquaintances and Strangers at any Party
• The Erdős‐Sós Conjecture for trees of diameter four
• On the structure of linear graphs
• Turán number for odd‐ballooning of trees