scientific article; zbMATH DE number 3561377
From MaRDI portal
Publication:4134005
zbMath0361.05037MaRDI QIDQ4134005
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Problem books (00A07) Coloring of graphs and hypergraphs (05C15)
Related Items
The neighborhood complexes of almost \(s\)-stable Kneser graphs ⋮ Erdős-Ko-Rado theorem with conditions on the maximal degree ⋮ On 6-sparse Steiner triple systems ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Uniform hypergraphs containing no grids ⋮ The number of 4-cycles in a graph ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ On regular hypergraphs of high girth ⋮ Hedetniemi's conjecture from the topological viewpoint ⋮ Upper bounds on the extremal number of the 4‐cycle ⋮ Large deviations in random latin squares ⋮ Spreading linear triple systems and expander triple systems ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ Sparse Steiner triple systems of order 21 ⋮ Anti‐Pasch optimal coverings with triples ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Asymptotically optimal erasure-resilient codes for large disk arrays. ⋮ Nonexistence of sparse triple systems over abelian groups and involutions ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Random Kneser graphs and hypergraphs ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ The existence of 5-sparse Steiner triple systems of order \(n \equiv 3 \mod 6\), \(n \notin \{9,15 \}\) ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ The chromatic number of almost stable Kneser hypergraphs ⋮ Chromatic number via Turán number ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Large girth approximate Steiner triple systems ⋮ A generalized Kneser conjecture ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ Triple systems with no three triples spanning at most five points ⋮ On the chromatic number of generalized Kneser hypergraphs ⋮ Graphs without quadrilaterals ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree ⋮ Linear dependencies among subsets of a finite set ⋮ Extremal problems concerning Kneser-graphs ⋮ A new extremal property of Steiner triple-systems ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture
This page was built for publication:
