On K_s-free subgraphs in K_s+k-free graphs and vertex Folkman numbers

DOI10.1007/S00493-011-2626-3zbMATH Open1249.05197OpenAlexW1984962604MaRDI QIDQ653983FDOQ653983

Authors: Andrzej Dudek, Vojtěch Rödl 

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2626-3

Recommendations

• An almost quadratic bound on vertex Folkman numbers
• Bounds for some generalized vertex Folkman numbers
• Chromatic vertex Folkman numbers
• New Upper 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)\).

zbMATH Keywords

Ramsey numbers\(K_s\)-free subgraphsforbiddenvertex Folkman numbers

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Ramsey type problem concerning vertex colourings
• Graphs without large triangle free subgraphs
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• The Construction of Certain Graphs
• The Ramsey property for graphs with forbidden complete subgraphs
• Constructive bounds for a Ramsey-type problem
• A new lower bound for a Ramsey-type problem
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• Title not available (Why is that?)
• Bounding Ramsey numbers through large deviation inequalities
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On minimal Folkman graphs
• New upper bound for a class of vertex Folkman numbers
• An almost quadratic bound on vertex Folkman numbers
• A Canonical Ramsey Theorem
• On the triangle vertex Folkman numbers
• New Upper Bound on Vertex Folkman Numbers

Cited In (25)

• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• On graphs with subgraphs having large independence numbers
• \(K_4\)-free graphs without large induced triangle-free subgraphs
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Dependent random choice
• A new lower bound for a Ramsey-type problem
• A Ramsey type problem concerning vertex colourings
• On the nonexistence of some generalized Folkman numbers
• On the minimum degree of minimal Ramsey graphs for multiple colours
• On some open questions for Ramsey and Folkman numbers
• The minimum degree of minimal Ramsey graphs for cliques
• On vertex Ramsey graphs with forbidden subgraphs
• On the use of senders for asymmetric tuples of cliques in Ramsey theory
• On the stability of the graph independence number
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• On generalized Ramsey numbers of Erdős and Rogers
• Improved bounds for the Erdős-Rogers function
• The asymptotics of \(r(4,t)\)
• On generalized Ramsey numbers for 3-uniform hypergraphs
• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• Short proofs of some extremal results
• When does the \(K_{4}\)-free process stop?
• On some generalized vertex Folkman numbers
• Chromatic vertex Folkman numbers
• On the Ramsey-Turán number with small \(s\)-independence number

This page was built for publication: On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers

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