Pages that link to "Item:Q4134005"
From MaRDI portal
The following pages link to Problems and results in combinatorial analysis (Q4134005):
Displaying 50 items.
- A combinatorial analysis of Severi degrees (Q291745) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← links)
- The chromatic number of almost stable Kneser hypergraphs (Q543913) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- A generalized Kneser conjecture (Q750443) (← links)
- Linear dependencies among subsets of a finite set (Q788726) (← links)
- A new extremal property of Steiner triple-systems (Q801918) (← links)
- On 6-sparse Steiner triple systems (Q868878) (← links)
- The existence of 5-sparse Steiner triple systems of order \(n \equiv 3 \mod 6\), \(n \notin \{9,15 \}\) (Q958754) (← links)
- Combinatorial methods in the study of marginal problems over separable spaces (Q1056453) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Erdős-Ko-Rado theorem with conditions on the maximal degree (Q1112818) (← links)
- Problems and results in combinatorial analysis and graph theory (Q1112837) (← links)
- Towards a solution of the Dinitz problem? (Q1118600) (← links)
- The neighborhood complexes of almost \(s\)-stable Kneser graphs (Q1633605) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- On the generalized Erdős-Kneser conjecture: proofs and reductions (Q1719585) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Some combinatorial problems (Q1802136) (← links)
- Graphs without quadrilaterals (Q1835928) (← links)
- Arithmetic problems of combinatorial analysis (Q1898268) (← links)
- Asymptotically optimal erasure-resilient codes for large disk arrays. (Q1972905) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- Spreading linear triple systems and expander triple systems (Q2198982) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs (Q2221931) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
- Nonexistence of sparse triple systems over abelian groups and involutions (Q2458260) (← links)
- Research problems from the 20th British Combinatorial Conference (Q2470428) (← links)
- The number of 4-cycles in a graph (Q2671849) (← links)
- Hedetniemi's conjecture from the topological viewpoint (Q2680825) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- Problems and results in combinatorial analysis. II (Q3050441) (← links)
- Problems and results in combinatorial analysis and combinatorial number theory (Q3856779) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- (Q4777298) (← links)
- (Q4798618) (← links)
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree (Q5001841) (← links)
- A Ramsey variant of the Brown–Erdős–Sós conjecture (Q5021660) (← links)
