scientific article; zbMATH DE number 3467166
From MaRDI portal
Publication:4052170
Cited in
(42)- Critical hypergraphs and interesting set-pair systems
- Exact solution of some Turán-type problems
- Simple hypergraphs with maximal number of adjacent pairs of edges
- Sperner families over a subset
- Gracious embedding of \(K_ N\) in \(Q_ n\)
- The proof of a conjecture of G. O. H. Katona
- Intersection theorems and a lemma of Kleitman
- On the minimum number of disjoint pairs in a family of finite sets
- Yanamoto inequality and gatherings
- Maximum antichains in the partition lattice
- More on the generalized Macaulay theorem. II
- An extremal problem among subsets of a set
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- A new upper bound for cancellative pairs
- Coding for write-unidirectional memories and conflict resolution
- On the Turán number of triple systems
- Cancellative pairs of families of sets
- On the extremal combinatorics of the Hamming space
- Old and new applications of Katona's circle
- On \(k\)-uniform random hypergraphs without generalized fans
- Asymptotic solution of a Turán-type problem
- Taxonomic classes of sets
- Perfect matchings in down-sets
- Erdös–Ko–Rado Theorem—22 Years Later
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Turán number of generalized triangles
- On the number of nonnegative sums
- Low order polynomial bounds on the expected performance of local improvement algorithms
- New Turán Exponents for Two Extremal Hypergraph Problems
- Stability results for two classes of hypergraphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Intersection-union families
- Invitation to intersection problems for finite sets
- An exact result for 3-graphs
- A generalization of the Kruskal-Katona theorem
- Union-free hypergraphs and probability theory
- Extremal problems whose solutions are the blowups of the small Witt- designs
- A new generalization of Mantel's theorem to \(k\)-graphs
- Applications of coding theory to communication combinatorial problems
- An intersection problem for codes
- An exact Turán result for the generalized triangle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052170)
