Publication:4052170
From MaRDI portal
zbMath0298.05142MaRDI QIDQ4052170
Publication date: 1974
05C35: Extremal problems in graph theory
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05A05: Permutations, words, matrices
05C99: Graph theory
Related Items
Low order polynomial bounds on the expected performance of local improvement algorithms, 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, 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, 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, Asymptotic solution of a Turán-type problem, Taxonomic classes of sets, Erdös–Ko–Rado Theorem—22 Years Later
