Some remarks on vertex Folkman numbers for hypergraphs

DOI10.1016/j.disc.2012.06.014zbMath1248.05117OpenAlexW2064320631MaRDI QIDQ449143

Reshma Ramadurai, Andrzej Dudek

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.014

zbMATH Keywords

hypergraphsFolkman numbers

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

An exponential-type upper bound for Folkman numbers

Cites Work

• An improved bound for the stepping-up lemma
• New upper bound for a class of vertex Folkman numbers
• An almost quadratic bound on vertex Folkman numbers
• A note on Ramsey numbers
• The Ramsey property for graphs with forbidden complete subgraphs
• A Ramsey type problem concerning vertex colourings
• On induced Folkman numbers
• Hypergraph Ramsey numbers
• A Canonical Ramsey Theorem
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On minimal Folkman graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item