Pages that link to "Item:Q3743337"
From MaRDI portal
The following pages link to The Chromatic Number of Kneser Hypergraphs (Q3743337):
Displaying 50 items.
- On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Hom complexes and hypergraph colorings (Q390395) (← links)
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← 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)
- Transversals to the convex hulls of all \(k\)-sets of discrete subsets of \(\mathbb R^n\) (Q616450) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- The de Bruijn-Erdős theorem for hypergraphs (Q690671) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- A generalized Kneser conjecture (Q750443) (← links)
- Kneser's conjecture, chromatic number, and homotopy (Q755592) (← links)
- Ein Zerlegungssatz für P(\(\kappa\) ) (Q800920) (← links)
- On generalized Kneser hypergraph colorings (Q857422) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
- Combinatorial Stokes formulas via minimal resolutions (Q1003649) (← links)
- Large disjoint subgraphs with the same order and size (Q1024273) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- On a packing and covering problem (Q1058516) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- Splitting necklaces (Q1097280) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings (Q1208342) (← links)
- The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- On the generalized Erdős-Kneser conjecture: proofs and reductions (Q1719585) (← links)
- On multicolor Ramsey numbers for loose \(k\)-paths of length three (Q1750208) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Ramsey numbers for partially-ordered sets (Q1789062) (← links)
- On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
- Box complexes, neighborhood complexes, and the chromatic number (Q1881691) (← links)
- On characterizing the critical graphs for matching Ramsey numbers (Q2004069) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- Choice number of Kneser graphs (Q2166315) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs (Q2221931) (← links)
- On the chromatic number of generalized Kneser graphs and Hadamard matrices (Q2280005) (← links)
- A note on homomorphisms of Kneser hypergraphs (Q2284780) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Clique chromatic numbers of intersection graphs (Q2313617) (← links)
- On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
- Complexes of graph homomorphisms (Q2382336) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Multicolor Ramsey numbers for triple systems (Q2436825) (← links)
