scientific article
From MaRDI portal
Publication:4047583
zbMath0295.05130MaRDI QIDQ4047583
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
On symmetric intersecting families of vectors, The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, Some extremal results on hypergraph Turán problems, On intersecting families of independent sets in trees, On Chvàtal's conjecture and a conjecture on families of signed sets, A Hilton-Milner-type theorem and an intersection conjecture for signed sets, Cross-Intersecting Families of Vectors, Erdős-Ko-Rado theorems for chordal graphs and trees, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Intersection theorems for t-valued functions, A sharp bound for the product of weights of cross-intersecting families, Multiple cross-intersecting families of signed sets, Nombre chromatique total d'un hypergraphe, Compression and Erdős-Ko-Rado graphs, Strongly intersecting integer partitions, The diametric theorem in Hamming spaces---optimal anticodes, A generalization of Talbot's theorem about King Arthur and his knights of the round table, On \(t\)-intersecting families of signed sets and permutations, The Erdős-Ko-Rado properties of set systems defined by double partitions, The Erdös-Ko-Rado Theorem for Integer Sequences, More on the Erdős-Ko-Rado theorem for integer sequences, Cross-intersecting families of vectors
