Compactness results in extremal graph theory
From MaRDI portal
Publication:1837701
DOI10.1007/BF02579234zbMath0508.05043OpenAlexW2110805362WikidataQ56698343 ScholiaQ56698343MaRDI QIDQ1837701
Paul Erdős, Miklós Simmonovits
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579234
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items
Well-mixing vertices and almost expanders, The number of \(C_{2\ell}\)-free graphs, Graphs without theta subgraphs, Ordering starlike trees by the totality of their spectral moments, Counting trees in graphs, Unnamed Item, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, Some Ramsey-Turán type results for hypergraphs, A path forward: tropicalization in extremal combinatorics, On the Turán number of some ordered even cycles, On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs, The Multistep Friendship Paradox, Inequalities for the number of walks in graphs, Uniform hypergraphs containing no grids, The Turán number of blow-ups of trees, A new proof of the Erdős-Simonovits conjecture on walks, Triangles in C5‐free graphs and hypergraphs of girth six, Turán numbers of bipartite graphs plus an odd cycle, Matrix power inequalities and the number of walks in graphs, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, On some graph densities in locally dense graphs, Bipartite-ness under smooth conditions, A note on the maximum number of triangles in a \(C_5\)-free graph, On subgraphs of \(C_{2k}\)-free graphs, On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition, The fine structure of octahedron-free graphs, Extended commonality of paths and cycles via Schur convexity, On a conjecture of Erdős and Simonovits: even cycles, Ramsey-type numbers involving graphs and hypergraphs with large girth, Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs, A counterexample to sparse removal, On the decay of crossing numbers, Induced Turán Numbers, General properties of some families of graphs defined by systems of equations, On the Turán number for the hexagon, Avoiding small subgraphs in Achlioptas processes, Graph norms and Sidorenko's conjecture, On the homogeneous algebraic graphs of large girth and their applications, Relative Turán numbers for hypergraph cycles, The lower and upper bounds of Turán number for odd wheels, Hypergraphs without exponents, Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle, Unified approach to the generalized Turán problem and supersaturation, Non-averaging subsets and non-vanishing transversals, On subgraphs of C2k-free graphs and a problem of Kühn and Osthus, Generalized Turán problems for disjoint copies of graphs, Polarities and \(2k\)-cycle-free graphs, A note on the Turán function of even cycles, Supersaturated graphs and hypergraphs, Planar Turán numbers of short paths, A new extremal property of Steiner triple-systems, Ramsey Numbers for Nontrivial Berge Cycles, Extremal problems whose solutions are the blowups of the small Witt- designs, The regularity method for graphs with few 4‐cycles
Cites Work
- Cycles of even length in graphs
- Inequalities in quadratic forms
- Graph Theory and Probability
- Über ein Problem von K. Zarankiewicz
- An Inequality Arising in Genetical Theory
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
