On a Ramsey-Turán type problem
From MaRDI portal
Publication:1229891
DOI10.1016/0095-8956(76)90057-5zbMath0337.05134OpenAlexW2040379672WikidataQ105675600 ScholiaQ105675600MaRDI QIDQ1229891
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90057-5
Related Items
Additive combinatorics and graph theory, Turán-Ramsey theorems and simple asymptotically extremal structures, Hypergraphs with zero chromatic threshold, Triangle-Tilings in Graphs Without Large Independent Sets, Degree sequence and independence in \(K(4)\)-free graphs, On the Ramsey-Turán density of triangles, On the chromatic number and independence number of hypergraph products, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, On the Ramsey-Turán number with small \(s\)-independence number, Some Ramsey-Turán type results for hypergraphs, More results on Ramsey-Turán type problems, Turán-Ramsey problems, The Ramsey-Turán problem for cliques, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, Turán-Ramsey Theorems and Kp-Independence Numbers, Embedding clique-factors in graphs with low \(\ell\)-independence number, Andrásfai and Vega graphs in Ramsey–Turán theory, Clique-factors in graphs with sublinear -independence number, Triangle factors of graphs without large independent sets and of weighted graphs, A note on independent sets in graphs with large minimum degree and small cliques, On Two Problems in Ramsey--Turán Theory, K4$K_4$‐free graphs have sparse halves, On 4-Sachs optimal graphs, A few remarks on Ramsey--Turán-type problems, A Ramsey–Turán theory for tilings in graphs, Ramsey-Turán problems with small independence numbers, On the Ramsey-Turán numbers of graphs and hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Two Conjectures in Ramsey--Turán Theory, Ramsey-Turán numbers for semi-algebraic graphs, Two results on Ramsey-Turán theory, The critical window for the classical Ramsey-Turán problem, \(K_r\)-factors in graphs with low independence number, Arithmetic progressions, different regularity lemmas and removal lemmas, Degree multiplicities and independent sets in \(K_ 4\)-free graphs, On Ramsey - Turan type theorems for hypergraphs, \(C_{3}\) saturated graphs, A hierarchy of randomness for graphs, Phase transitions in Ramsey-Turán theory, Note on a Ramsey-Turán type problem, On bipartite graphs having minimum fourth adjacency coefficient
Cites Work
