Ramsey numbers involving large dense graphs and bipartite Turán numbers

DOI10.1016/S0095-8956(02)00011-4zbMath1031.05085OpenAlexW2084961267MaRDI QIDQ1405120

Wenan Zang, Yusheng Li

Publication date: 25 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00011-4

zbMATH Keywords

boundsRamsey numbersTuran numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items

Ramsey numbers of \(K_3\) and \(K_{n,n}\) ⋮ Independence numbers of hypergraphs with sparse neighborhoods. ⋮ Ramsey numbers of some bipartite graphs versus complete graphs ⋮ Ramsey numbers involving graphs with large degrees ⋮ Bipartite Ramsey numbers involving large \(K_{n,n}\) ⋮ On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs

Cites Work

• A Ramsey problem of Harary on graphs with prescribed size
• Asymptotic lower bounds for Ramsey functions
• New asymptotics for bipartite Turán numbers
• On book-complete graph Ramsey numbers
• Norm-graphs and bipartite Turán numbers
• On maximal paths and circuits of graphs
• Bounding Ramsey numbers through large deviation inequalities
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On Graphs that do not Contain a Thomsen Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item