New Upper Bound on Vertex Folkman Numbers

DOI10.1007/978-3-540-78773-0_41zbMATH Open1136.05312OpenAlexW1536088352MaRDI QIDQ5458552FDOQ5458552

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

Recommendations

• New upper bound for a class of vertex Folkman numbers
• An almost quadratic bound on vertex Folkman numbers
• Upper bounds for the vertex Folkman number \(F_v(3,3,3;4)\) and \(F_v(3,3,3;5)\).
• On induced Folkman numbers
• scientific article; zbMATH DE number 1835112

zbMATH Keywords

Ramsey theoryvertex Folkman numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites Work

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

Cited In (5)

• An almost quadratic bound on vertex Folkman numbers
• A Ramsey type problem concerning vertex colourings
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$
• Title not available (Why is that?)

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

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