Large triangle-free subgraphs in graphs without \(K_ 4\)
From MaRDI portal
Publication:1078195
DOI10.1007/BF01788087zbMath0596.05037OpenAlexW1971994465WikidataQ97694759 ScholiaQ97694759MaRDI QIDQ1078195
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788087
Related Items
Towards the 0-statement of the Kohayakawa-Kreuter conjecture, A Folkman Linear Family, Globally sparse vertex‐ramsey graphs, Small subsets inherit sparse \(\varepsilon\)-regularity, Mantel's theorem for random graphs, A new proof of the KŁR conjecture, Extremal results for random discrete structures, Combinatorial theorems in sparse random sets, Turán's extremal problem in random graphs: Forbidding odd cycles, Three hundred million points suffice, Ramsey properties of random hypergraphs, Turán's theorem for pseudo-random graphs, Some recent results on Ramsey-type numbers, On \(K^ 4\)-free subgraphs of random graphs, Ramsey goodness of trees in random graphs, Asymmetric Ramsey properties of random graphs involving cliques and cycles, Tuza's conjecture for random graphs, LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS, Finding Folkman Numbers via MAX CUT Problem, On some edge Folkman numbers, small and large, Turán‐type problems for long cycles in random and pseudo‐random graphs, The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups, Unnamed Item, An analogue of the Erdős-Gallai theorem for random graphs, Blowup Ramsey numbers, Turánnical hypergraphs, Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process, Ramsey Goodness of Clique Versus Paths in Random Graphs, Sharp thresholds for certain Ramsey properties of random graphs, Counting sum-free sets in abelian groups, Random sum-free subsets of abelian groups, \(p\)-arrangeable graphs are Folkman linear, Regular pairs in sparse random graphs I, The typical structure of sparse $K_{r+1}$-free graphs, Inverting the Turán problem with chromatic number, Many \(T\) copies in \(H\)-free graphs, On Erdős–Ko–Rado for Random Hypergraphs II, On Erdős–Ko–Rado for random hypergraphs I, Random Van der Waerden theorem, Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties, Independent sets in hypergraphs, On Some Open Questions for Ramsey and Folkman Numbers, Random Ramsey graphs for the four-cycle, Upper bounds on probability thresholds for asymmetric Ramsey properties, Inverse Turán numbers, On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
Cites Work
- 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
- Unnamed Item
- Unnamed Item
