scientific article; zbMATH DE number 3561377
From MaRDI portal
Publication:4134005
Recommendations
Cited in
(68)- The neighborhood complexes of almost \(s\)-stable Kneser graphs
- A new extremal property of Steiner triple-systems
- On the chromatic number of general Kneser hypergraphs
- Combinatorial methods in the study of marginal problems over separable spaces
- Graphs without quadrilaterals
- Extremal problems concerning Kneser-graphs
- The existence of 5-sparse Steiner triple systems of order \(n \equiv 3 \mod 6\), \(n \notin \{9,15 \}\)
- Combinatorial methods in analysis
- Uniform hypergraphs containing no grids
- Sparse hypergraphs with applications to coding theory
- A combinatorial analysis of Severi degrees
- Matchings with few colors in colored complete graphs and hypergraphs
- Asymptotically optimal erasure-resilient codes for large disk arrays.
- scientific article; zbMATH DE number 3645102 (Why is no real title available?)
- On the generalized Erdős-Kneser conjecture: proofs and reductions
- Hedetniemi's conjecture from the topological viewpoint
- Linear dependencies among subsets of a finite set
- On the chromatic number of generalized Kneser hypergraphs
- Colorful subhypergraphs in Kneser hypergraphs
- Spreading linear triple systems and expander triple systems
- scientific article; zbMATH DE number 1416063 (Why is no real title available?)
- The chromatic number of almost stable Kneser hypergraphs
- Nonexistence of sparse triple systems over abelian groups and involutions
- scientific article; zbMATH DE number 1880257 (Why is no real title available?)
- scientific article; zbMATH DE number 7203464 (Why is no real title available?)
- scientific article; zbMATH DE number 4029581 (Why is no real title available?)
- Erdös–Ko–Rado Theorem—22 Years Later
- Random Kneser graphs and hypergraphs
- Problems and results in combinatorial analysis and graph theory
- Towards a solution of the Dinitz problem?
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
- Chromatic number via Turán number
- Arithmetic problems of combinatorial analysis
- On regular hypergraphs of high girth
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Intersection patterns of finite sets and of convex sets
- The number of 4-cycles in a graph
- scientific article; zbMATH DE number 3657816 (Why is no real title available?)
- On a conjecture of Erdős on locally sparse Steiner triple systems
- Coloring properties of categorical product of general Kneser hypergraphs
- Maximum size intersecting families of bounded minimum positive co-degree
- Large deviations in random latin squares
- scientific article; zbMATH DE number 3453609 (Why is no real title available?)
- Sharp bounds for the chromatic number of random Kneser graphs
- Hedetniemi's conjecture for Kneser hypergraphs
- On uniform relationships between combinatorial problems
- Colorful subhypergraphs in uniform hypergraphs
- On 6-sparse Steiner triple systems
- A Ramsey variant of the Brown-Erdős-Sós conjecture
- Degenerate Turán densities of sparse hypergraphs
- Large girth approximate Steiner triple systems
- A generalized Kneser conjecture
- Sparse hypergraphs: new bounds and constructions
- Research problems from the 20th British Combinatorial Conference
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Triple systems with no three triples spanning at most five points
- scientific article; zbMATH DE number 124522 (Why is no real title available?)
- Some combinatorial problems
- Chromatic number of random Kneser hypergraphs
- Towards the Erdős-Gallai cycle decomposition conjecture
- Towards the Erdős-Gallai cycle decomposition conjecture
- Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
- Spreading linear triple systems and expander triple systems
- On the \((6,4)\)-problem of Brown, Erdős, and Sós
- scientific article; zbMATH DE number 4145901 (Why is no real title available?)
- Sparse Steiner triple systems of order 21
- Upper bounds on the extremal number of the 4‐cycle
- Anti‐Pasch optimal coverings with triples
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 Q4134005)
