Extremal problems whose solutions are the blowups of the small Witt- designs
From MaRDI portal
(Redirected from Publication:807640)
Extremal problems in graph theory (05C35) Combinatorial identities, bijective combinatorics (05A19) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial inequalities (05A20) Extremal set theory (05D05) Steiner systems in finite geometry (51E10)
Recommendations
Cites work
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 4008442 (Why is no real title available?)
- scientific article; zbMATH DE number 4031696 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3467166 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- A new generalization of the Erdős-Ko-Rado theorem
- Compactness results in extremal graph theory
- Exact solution of some Turán-type problems
- Hypergraphs do not jump
- Lower bounds for constant weight codes
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On extremal problems of graphs and generalized graphs
- On the theory of graphs
- Some Ramsey-Turán type results for hypergraphs
- Supersaturated graphs and hypergraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Union-free hypergraphs and probability theory
Cited in
(61)- A 2-stable family of triple systems
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Four-vertex traces of finite sets
- 4-books of three pages
- On the density of 2-colorable 3-graphs in which any four points span at most two edges
- Dense 3-uniform hypergraphs containing a large clique
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Generating non-jumping numbers recursively
- The connection between polynomial optimization, maximum cliques and Turán densities
- Shattered matchings in intersecting hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- A hypergraph Turán theorem via Lagrangians of intersecting families
- On substructure densities of hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- A unified approach to hypergraph stability
- On possible Turán densities
- On \(k\)-uniform random hypergraphs without generalized fans
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- Lagrangian densities of linear forests and Turán numbers of their extensions
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
- An irrational Turán density via hypergraph Lagrangian densities
- Lagrangian densities of enlargements of matchings in hypergraphs
- A note on the structure of Turán densities of hypergraphs
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
- Lagrangian-perfect hypergraphs
- A hypergraph Turán theorem via Lagrangians of intersecting families
- Non-jumping numbers for 5-uniform hypergraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- Asymptotic solution of a Turán-type problem
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
- On cliques and Lagrangians of hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Maximisers of the hypergraph Lagrangian outside the principal range
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- Some results on Lagrangians of hypergraphs
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
- The Hessian matrix of Lagrange function
- A new generalization of Mantel's theorem to \(k\)-graphs
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- Hypergraphs with independent neighborhoods
- On Motzkin-Straus type results for non-uniform hypergraphs
- Lagrangians of hypergraphs. II: When colex is best
- Two extremal problems related to orders
- An irrational Lagrangian density of a single hypergraph
- Turán number of generalized triangles
- An exact Turán result for the generalized triangle
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- 2-cancellative hypergraphs and codes
- A note on generalized Lagrangians of non-uniform hypergraphs
This page was built for publication: Extremal problems whose solutions are the blowups of the small Witt- designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807640)
