What we know and what we do not know about Turán numbers

DOI10.1007/BF01929486zbMath0839.05050MaRDI QIDQ1895823

Alexander Sidorenko

Publication date: 18 June 1996

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

zbMATH Keywords

covering numberTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Transversal (matching) theory (05D15)

Related Items (73)

Universal and unavoidable graphs ⋮ Stability theorems for cancellative hypergraphs ⋮ Extremal problems on set systems ⋮ Unnamed Item ⋮ Edge-minimum saturated \(k\)-planar drawings ⋮ Guessing numbers and extremal graph theory ⋮ Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs ⋮ A spectral condition for the existence of the square of a path ⋮ The maximum spectral radius of wheel-free graphs ⋮ On minimum saturated matrices ⋮ Chain method for panchromatic colorings of hypergraphs ⋮ The maximal length of a gap between \(r\)-graph Turán densities ⋮ The formula for Turán number of spanning linear forests ⋮ On the codegree density of complete 3-graphs and related problems ⋮ Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Uniform Determinantal Representations ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles ⋮ Optimizing diversity ⋮ General independence sets in random strongly sparse hypergraphs ⋮ Linearity of saturation for Berge hypergraphs ⋮ On Turán numbers for disconnected hypergraphs ⋮ Uniform Turán density of cycles ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Extremal problems in hypergraph colourings ⋮ Matroid Horn functions ⋮ On the limit of the positive \(\ell\)-degree Turán problem ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ On colorings of 3-homogeneous hypergraphs in 3 colors ⋮ Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ The Turán number of directed paths and oriented cycles ⋮ On the Erdős-Hajnal problem for 3-uniform hypergraphs ⋮ Generating All Sets With Bounded Unions ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ The Turán number for spanning linear forests ⋮ On possible Turán densities ⋮ Turán problems on non-uniform hypergraphs ⋮ Minimum number of affine simplices of given dimension ⋮ Properly edge-coloured subgraphs in colourings of bounded degree ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Regular Behavior of the Maximal Hypergraph Chromatic Number ⋮ Extremal Graphs with Local Covering Conditions ⋮ On Turán numbers of the complete 4-graphs ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ The spectral radius of graphs with no odd wheels ⋮ The effect of edge weights on clique weights ⋮ Unavoidable hypergraphs ⋮ Induced Turán Numbers ⋮ Quadratic reformulations of nonlinear binary optimization problems ⋮ Non-uniform Turán-type problems ⋮ Asymptotic Bounds for General Covering Designs ⋮ Connected Covering Numbers ⋮ The signless Laplacian spectral radius of graphs with no intersecting triangles ⋮ New coverings oft-sets with (t + 1)-sets ⋮ On the Erdős-Hajnal problem for 3-graphs ⋮ On the chromatic number of generalized Kneser graphs and Hadamard matrices ⋮ On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem ⋮ Chromatic numbers of Kneser-type graphs ⋮ Daisies and Other Turán Problems ⋮ Turán numbers of theta graphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ On non-strong jumping numbers and density structures of hypergraphs ⋮ Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\) ⋮ On a Turán-type hypergraph problem of Brown, Erdős and T. Sós ⋮ Turán problems for vertex-disjoint cliques in multi-partite hypergraphs ⋮ Connected coverings and an application to oriented matroids ⋮ Complexity of choosing subsets from color sets ⋮ A hypergraph Turán problem with no stability ⋮ Saturation numbers for disjoint stars ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Independence numbers and chromatic numbers of some distance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
• Minimal coverings of pairs by triples
• Covering pairs by \(q^ 2+q+1\) sets
• Lower bounds for coverings of pairs by large blocks
• Method of quadratic forms in the Turan combinatorial problem
• A note on the probabilistic approach to Turan's problem
• On a packing and covering problem
• Lower bounds for Turán's problem
• Covering triples by quadruples: an asymptotic solution
• Coverings of pairs by quintuples
• Precise values of Turan numbers
• Coverings pairs by quintuples: The case v congruent to 3 (mod 4)
• On the combinatorial problems which I would most like to see solved
• Systems of sets possessing the T-property
• A class of constructions for Turan's (3,4)-problem
• On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
• Method for construction of (3,4)-graphs
• On Turan hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• On coverings
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• New constructions for covering designs

This page was built for publication: What we know and what we do not know about Turán numbers