Extremal problems whose solutions are the blowups of the small Witt- designs
From MaRDI portal
Publication:807640
DOI10.1016/0097-3165(89)90067-8zbMath0731.05030OpenAlexW2089148861MaRDI QIDQ807640
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(89)90067-8
Extremal problems in graph theory (05C35) Combinatorial identities, bijective combinatorics (05A19) Hypergraphs (05C65) Combinatorial inequalities (05A20) Extremal set theory (05D05) Steiner systems in finite geometry (51E10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
2-Cancellative Hypergraphs and Codes, Maximum cliques of hypergraphs and polynomial optimization, On Frankl and Füredi's conjecture for 3-uniform hypergraphs, Connection between the clique number and the Lagrangian of 3-uniform hypergraphs, A Motzkin-Straus type result for 3-uniform hypergraphs, On substructure densities of hypergraphs, Some results on Lagrangians of hypergraphs, On graph-Lagrangians and clique numbers of 3-uniform hypergraphs, An Irrational Lagrangian Density of a Single Hypergraph, Turán number of generalized triangles, Unnamed Item, Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions, Maximisers of the hypergraph Lagrangian outside the principal range, The Hessian matrix of Lagrange function, Using Lagrangians of hypergraphs to find non-jumping numbers. II., On Motzkin-Straus type results for non-uniform hypergraphs, A hypergraph Turán theorem via Lagrangians of intersecting families, A new generalization of Mantel's theorem to \(k\)-graphs, The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex, A tensor optimization algorithm for computing Lagrangians of hypergraphs, Lagrangian-perfect hypergraphs, \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles, Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere, Non-jumping numbers for 5-uniform hypergraphs, A 2-stable family of triple systems, Four-vertex traces of finite sets, Lagrangian densities of linear forests and Turán numbers of their extensions, An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications, Two extremal problems related to orders, On the Chromatic Thresholds of Hypergraphs, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS, Hypergraphs with independent neighborhoods, On possible Turán densities, On graph-Lagrangians of hypergraphs containing dense subgraphs, On the largest graph-Lagrangian of 3-graphs with fixed number of edges, Shattered matchings in intersecting hypergraphs, A note on the structure of Turán densities of hypergraphs, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), On Lagrangians of \(r\)-uniform hypergraphs, Generating non-jumping numbers recursively, Dense 3-uniform hypergraphs containing a large clique, An exact Turán result for the generalized triangle, Computing the \(p\)-spectral radii of uniform hypergraphs with applications, On \(k\)-uniform random hypergraphs without generalized fans, A note on generalized Lagrangians of non-uniform hypergraphs, The connection between polynomial optimization, maximum cliques and Turán densities, On the density of 2-colorable 3-graphs in which any four points span at most two edges, 4-books of three pages, Asymptotic solution of a Turán-type problem, Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs, Some Motzkin-Straus type results for non-uniform hypergraphs, Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs, Lagrangians of hypergraphs. II: When colex is best, The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension, Lagrangian densities of enlargements of matchings in hypergraphs, Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions, Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false, An irrational Turán density via hypergraph Lagrangian densities, A unified approach to hypergraph stability, A hypergraph Turán theorem via Lagrangians of intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Supersaturated graphs and hypergraphs
- Union-free hypergraphs and probability theory
- Some Ramsey-Turán type results for hypergraphs
- Exact solution of some Turán-type problems
- Hypergraphs do not jump
- Three-graphs without two triples whose symmetric difference is contained in a third
- Compactness results in extremal graph theory
- On extremal problems of graphs and generalized graphs
- Lower bounds for constant weight codes
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the theory of graphs
- A new generalization of the Erdős-Ko-Rado theorem
