On induced Folkman numbers

DOI10.1002/RSA.20397zbMATH Open1245.05045OpenAlexW2091606606MaRDI QIDQ2904596FDOQ2904596

Authors: Andrzej Dudek, Reshma Ramadurai, Vojtěch Rödl 

Publication date: 14 August 2012

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20397

Recommendations

• New Upper Bound on Vertex Folkman Numbers
• scientific article; zbMATH DE number 866651
• On generalized Folkman numbers
• Some remarks on vertex Folkman numbers for hypergraphs
• An upper bound for the Folkman number F(3, 3; 5)

zbMATH Keywords

Folkman numbers

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• An almost quadratic bound on vertex Folkman numbers
• A Canonical Ramsey Theorem

Cited In (6)

• Multiple vertex coverings by cliques
• A Folkman linear family
• Some remarks on vertex Folkman numbers for hypergraphs
• On the Folkman Numberf(2, 3, 4)
• New Upper Bound on Vertex Folkman Numbers
• On generalized Folkman numbers

This page was built for publication: On induced Folkman numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904596)