Some exact Ramsey-Turán numbers
From MaRDI portal
Publication:3144853
DOI10.1112/blms/bds053zbMath1254.05081arXiv1109.4472OpenAlexW3102068398MaRDI QIDQ3144853
Publication date: 10 December 2012
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.4472
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Graph representations (geometric and intersection representations, etc.) (05C62) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (10)
Hypergraphs with zero chromatic threshold ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ On Two Problems in Ramsey--Turán Theory ⋮ The bandwidth theorem for locally dense graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Phase transitions in Ramsey-Turán theory
This page was built for publication: Some exact Ramsey-Turán numbers