Large triangle-free subgraphs in graphs without \(K_ 4\)

DOI10.1007/BF01788087zbMath0596.05037WikidataQ97694759 ScholiaQ97694759MaRDI QIDQ1078195

Vojtěch Rödl, Peter Frankl

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

random graphs; edge-Ramsey graph; sparse complete graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C55: Generalized Ramsey theory

Related Items

Globally sparse vertex‐ramsey graphs, Unnamed Item, Regular pairs in sparse random graphs I, Small subsets inherit sparse \(\varepsilon\)-regularity, Turán's theorem for pseudo-random graphs, Three hundred million points suffice, Random Ramsey graphs for the four-cycle, Ramsey properties of random hypergraphs, On \(K^ 4\)-free subgraphs of random graphs, Turán's extremal problem in random graphs: Forbidding odd cycles, Finding Folkman Numbers via MAX CUT Problem

Cites Work

• Unnamed Item
• Unnamed Item
• On universality of graphs with uniformly distributed edges
• The Ramsey property for graphs with forbidden complete subgraphs
• On Sets of Acquaintances and Strangers at any Party
• On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations