Pages that link to "Item:Q1256485"
From MaRDI portal
The following pages link to A short proof of Kneser's conjecture (Q1256485):
Displayed 50 items.
- On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- On \(q\)-analogues and stability theorems (Q408961) (← links)
- Paths of homomorphisms from stable Kneser graphs (Q485504) (← links)
- The equivariant topology of stable Kneser graphs (Q640844) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- A generalized Kneser conjecture (Q750443) (← links)
- Covering radius and the chromatic number of Kneser graphs (Q805622) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
- A combinatorial proof of the Borsuk-Ulam antipodal point theorem (Q1123437) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Helly property in finite set systems (Q1208035) (← links)
- The order dimension of two levels of the Boolean lattices (Q1337568) (← links)
- Tiling Hamming space with few spheres (Q1374207) (← links)
- The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
- The neighborhood complexes of almost \(s\)-stable Kneser graphs (Q1633605) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) (Q1752691) (← links)
- Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini (Q1835683) (← links)
- Nearly bipartite graphs with large chromatic number (Q1839258) (← links)
- The toughness of Kneser graphs (Q2037560) (← links)
- Choice number of Kneser graphs (Q2166315) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
- A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) (Q2279276) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- Decomposition of the Kneser graph into paths of length four (Q2342612) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- On the chromatic number of some geometric type Kneser graphs (Q2387203) (← links)
- A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) (Q2411599) (← links)
- Generalized fractional and circular total colorings of graphs (Q2516678) (← links)
- Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
- Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
- The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
- Borsuk's theorem through complementary pivoting (Q3890454) (← links)
- On the chromatic number of Kneser hypergraphs (Q4330574) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- On graphs with strongly independent color-classes (Q4736765) (← links)
- (Q5002681) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- The chromatic profile of locally colourable graphs (Q5886349) (← links)
- On a problem in combinatorial geometry (Q5917288) (← links)
- On the connectivity of the disjointness graph of segments of point sets in general position in the plane (Q6045406) (← links)