scientific article; zbMATH DE number 3467166
From MaRDI portal
Publication:4052170
zbMATH Open0298.05142MaRDI QIDQ4052170FDOQ4052170
Authors: Gyula O. H. Katona 
Publication date: 1974
Title of this publication is not available (Why is that?)
Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)
Cited In (41)
- Yanamoto inequality and gatherings
- Critical hypergraphs and interesting set-pair systems
- An extremal problem among subsets of a set
- A generalization of the Kruskal-Katona theorem
- Applications of coding theory to communication combinatorial problems
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the number of nonnegative sums
- Maximum antichains in the partition lattice
- Taxonomic classes of sets
- Stability results for two classes of hypergraphs
- On the extremal combinatorics of the Hamming space
- Cancellative pairs of families of sets
- An exact result for 3-graphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- On \(k\)-uniform random hypergraphs without generalized fans
- Coding for write-unidirectional memories and conflict resolution
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Exact solution of some Turán-type problems
- Old and new applications of Katona's circle
- Union-free hypergraphs and probability theory
- Erdös–Ko–Rado Theorem—22 Years Later
- Asymptotic solution of a Turán-type problem
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- An intersection problem for codes
- Gracious embedding of \(K_ N\) in \(Q_ n\)
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- A new generalization of Mantel's theorem to \(k\)-graphs
- Perfect matchings in down-sets
- Sperner families over a subset
- Invitation to intersection problems for finite sets
- On the Turán number of triple systems
- Simple hypergraphs with maximal number of adjacent pairs of edges
- On the minimum number of disjoint pairs in a family of finite sets
- More on the generalized Macaulay theorem. II
- Turán number of generalized triangles
- Low order polynomial bounds on the expected performance of local improvement algorithms
- An exact Turán result for the generalized triangle
- A new upper bound for cancellative pairs
- New Turán Exponents for Two Extremal Hypergraph Problems
- The proof of a conjecture of G. O. H. Katona
- Intersection theorems and a lemma of Kleitman
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)
