A note on the Size-Ramsey number of long subdivisions of graphs

DOI10.1051/ita:2005019zbMath1075.05054OpenAlexW1964435369MaRDI QIDQ4680735

Penny E. Haxell, Yoshiharu Kohayakawa, Jair Donadelli

Publication date: 7 June 2005

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_1_191_0

zbMATH Keywords

Ramsey theoryexpanders

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Degree Ramsey Numbers of Graphs, Rolling backwards can move you forward: On embedding problems in sparse expanders, Degree Ramsey numbers for even cycles, The size‐Ramsey number of short subdivisions, Degree bipartite Ramsey numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number of a graph with bounded maximum degree
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Expanding graphs contain all small trees
• Explicit construction of linear sized tolerant networks
• Ramanujan graphs
• Hamiltonian circuits in random graphs
• The size Ramsey number
• Partitioning complete bipartite graphs by monochromatic cycles
• Embedding trees into graphs of large girth
• Ramsey numbers for trees of small maximum degree
• The Ramsey size number of dipaths
• On a conjecture about trees in graphs with large girth
• The size Ramsey number of trees with bounded degree
• Subdivided graphs have linear ramsey numbers
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Regular pairs in sparse random graphs I
• Asymptotic Size Ramsey Results for Bipartite Graphs
• On size Ramsey number of paths, trees, and circuits. I
• Size ramsey numbers of stars versus 4‐chromatic graphs
• The Induced Size-Ramsey Number of Cycles
• The size-Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree