New Upper Bound on Vertex Folkman Numbers

DOI10.1007/978-3-540-78773-0_41zbMath1136.05312OpenAlexW1536088352MaRDI QIDQ5458552

Andrzej Dudek, Vojtěch Rödl

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_41

zbMATH Keywords

Ramsey theoryvertex Folkman numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (3)

Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$ ⋮ On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers ⋮ An almost quadratic bound on vertex Folkman numbers

Cites Work

• New upper bound for a class of vertex Folkman numbers
• A Ramsey type problem concerning vertex colourings
• Polarities and \(2k\)-cycle-free graphs
• A Canonical Ramsey Theorem
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On minimal Folkman graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New Upper Bound on Vertex Folkman Numbers