scientific article; zbMATH DE number 3561377
From MaRDI portal
Publication:4134005
zbMATH Open0361.05037MaRDI QIDQ4134005FDOQ4134005
Authors: P. Erdős 
Publication date: 1976
Title of this publication is not available (Why is that?)
Recommendations
Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Problem books (00A07)
Cited In (68)
- Uniform hypergraphs containing no grids
- On the chromatic number of generalized Kneser hypergraphs
- Large girth approximate Steiner triple systems
- Extremal problems concerning Kneser-graphs
- Coloring properties of categorical product of general Kneser hypergraphs
- Hedetniemi's conjecture for Kneser hypergraphs
- A new extremal property of Steiner triple-systems
- Colorful subhypergraphs in Kneser hypergraphs
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
- Intersection patterns of finite sets and of convex sets
- Chromatic number of random Kneser hypergraphs
- On 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 \}\)
- The chromatic number of almost stable Kneser hypergraphs
- Title not available (Why is that?)
- Matchings with few colors in colored complete graphs and hypergraphs
- Chromatic number via Turán number
- Sharp bounds for the chromatic number of random Kneser graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonexistence of sparse triple systems over abelian groups and involutions
- Towards a solution of the Dinitz problem?
- On a conjecture of Erdős on locally sparse Steiner triple systems
- A combinatorial analysis of Severi degrees
- Arithmetic problems of combinatorial analysis
- On uniform relationships between combinatorial problems
- The neighborhood complexes of almost \(s\)-stable Kneser graphs
- Title not available (Why is that?)
- On the generalized Erdős-Kneser conjecture: proofs and reductions
- Some combinatorial problems
- Asymptotically optimal erasure-resilient codes for large disk arrays.
- Title not available (Why is that?)
- Problems and results in combinatorial analysis and graph theory
- The number of 4-cycles in a graph
- A Ramsey variant of the Brown–Erdős–Sós conjecture
- Erdös–Ko–Rado Theorem—22 Years Later
- A generalized Kneser conjecture
- Title not available (Why is that?)
- Research problems from the 20th British Combinatorial Conference
- Sparse Hypergraphs with Applications to Coding Theory
- Title not available (Why is that?)
- On regular hypergraphs of high girth
- Triple systems with no three triples spanning at most five points
- Combinatorial methods in analysis
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Linear dependencies among subsets of a finite set
- On 6-sparse Steiner triple systems
- Combinatorial methods in the study of marginal problems over separable spaces
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Large deviations in random latin squares
- Colorful subhypergraphs in uniform hypergraphs
- Hedetniemi's conjecture from the topological viewpoint
- Spreading linear triple systems and expander triple systems
- Random Kneser graphs and hypergraphs
- Sparse hypergraphs: new bounds and constructions
- Title not available (Why is that?)
- Degenerate Turán densities of sparse hypergraphs
- Graphs without quadrilaterals
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree
- On the \((6,4)\)-problem of Brown, Erdős, and Sós
- 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
- Title not available (Why is that?)
- Towards the Erdős-Gallai cycle decomposition conjecture
- Spreading linear triple systems and expander triple systems
- Upper bounds on the extremal number of the 4‐cycle
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)
