An almost quadratic bound on vertex Folkman numbers

DOI10.1016/j.jctb.2009.05.004zbMath1214.05055OpenAlexW2148550085MaRDI QIDQ965241

Andrzej Dudek, Vojtěch Rödl

Publication date: 21 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2009.05.004

zbMATH Keywords

vertex Folkman numberscoloring of graphsgeneralized Ramsey theory

Mathematics Subject Classification ID

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

Related Items

On induced Folkman numbers, Some recent results on Ramsey-type numbers, Chromatic vertex Folkman numbers, Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs, Some remarks on vertex Folkman numbers for hypergraphs, On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers, An exponential-type upper bound for Folkman numbers, On the nonexistence of some generalized Folkman numbers, Vertex colorings of graphs without short odd cycles

Cites Work

• New upper bound for a class of vertex Folkman numbers
• On the independence number of random graphs
• A note on the independence number of triangle-free graphs
• Graphs without large triangle free subgraphs
• The Ramsey property for graphs with forbidden complete subgraphs
• A Ramsey type problem concerning vertex colourings
• Polarities and \(2k\)-cycle-free graphs
• A Canonical Ramsey Theorem
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• New Upper Bound on Vertex Folkman Numbers
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• The Construction of Certain Graphs
• On minimal Folkman graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item