scientific article

zbMath0298.05142MaRDI QIDQ4052170

Gyula O. H. Katona

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Graph theory (05C99)

Related Items

Cancellative pairs of families of sets, On the extremal combinatorics of the Hamming space, Turán number of generalized triangles, Exact solution of some Turán-type problems, A new generalization of Mantel's theorem to \(k\)-graphs, Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors, Stability of extremal hypergraphs with applications to an edge-coloring problem, Simple hypergraphs with maximal number of adjacent pairs of edges, Sperner families over a subset, Perfect matchings in down-sets, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, Applications of coding theory to communication combinatorial problems, An intersection problem for codes, On the number of nonnegative sums, New Turán Exponents for Two Extremal Hypergraph Problems, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, An exact Turán result for the generalized triangle, Gracious embedding of \(K_ N\) in \(Q_ n\), On \(k\)-uniform random hypergraphs without generalized fans, A new upper bound for cancellative pairs, The proof of a conjecture of G. O. H. Katona, Erdös–Ko–Rado Theorem—22 Years Later, Intersection theorems and a lemma of Kleitman, Asymptotic solution of a Turán-type problem, Taxonomic classes of sets, On the minimum number of disjoint pairs in a family of finite sets, Yanamoto inequality and gatherings, Old and new applications of Katona's circle, Maximum antichains in the partition lattice, Invitation to intersection problems for finite sets, More on the generalized Macaulay theorem. II, An extremal problem among subsets of a set, Low order polynomial bounds on the expected performance of local improvement algorithms, Coding for write-unidirectional memories and conflict resolution, Stability Results for Two Classes of Hypergraphs, 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, On the Turán number of triple systems, Critical hypergraphs and interesting set-pair systems