On a valence problem in extremal graph theory
From MaRDI portal
Publication:2562797
DOI10.1016/0012-365X(73)90126-XzbMath0268.05121OpenAlexW2121190404WikidataQ56001754 ScholiaQ56001754MaRDI QIDQ2562797
Paul Erdős, Miklós Simmonovits
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(73)90126-x
Related Items
The chromatic profile of locally colourable graphs, Dense graphs with small clique number, Hypergraphs with zero chromatic threshold, Triangle-free subgraphs of random graphs, On the Ramsey-Turán density of triangles, Triangle-free four-chromatic graphs, Additive approximation for edge-deletion problems, Triangle-Free Graphs with High Minimal Degrees, On the Structure of Graphs with Given Odd Girth and Large Minimum Degree, The chromatic profile of locally bipartite graphs, Bipartite induced density in triangle-free graphs, Andrásfai and Vega graphs in Ramsey–Turán theory, Turán numbers of bipartite graphs plus an odd cycle, Extremal problems for the \(p\)-spectral radius of graphs, Minimum degree and the graph removal lemma, The critical number of dense triangle-free binary matroids, Cycles with consecutive odd lengths, The minimum degree removal lemma thresholds, On the Chromatic Thresholds of Hypergraphs, Odd circuits in dense binary matroids, Critical graphs without triangles: an optimum density construction, On the combinatorial problems which I would most like to see solved, \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, On the chromatic number of \(H\)-free graphs of large minimum degree, On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite, The maximum edit distance from hereditary graph properties, Triangle-Free Subgraphs of Random Graphs, Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\), A note on generalized pentagons, Measures on monotone properties of graphs, A note on stability for maximal \(F\)-free graphs, On the structure of Dense graphs with bounded clique number, Homomorphism thresholds for odd cycles, Turán's theorem inverted, Graphs of odd girth 7 with large degree, A unified approach to hypergraph stability
Cites Work
