The following pages link to (Q3869375):
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)
- Paths of homomorphisms from stable Kneser graphs (Q485504) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- The chromatic number of almost stable Kneser hypergraphs (Q543913) (← links)
- The equivariant topology of stable Kneser graphs (Q640844) (← links)
- Independent sets in the union of two Hamiltonian cycles (Q668015) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- On coloring graphs with locally small chromatic number (Q759761) (← links)
- Edge-critical subgraphs of Schrijver graphs (Q777487) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- Symmetries of the stable Kneser graphs (Q972851) (← links)
- Combinatorial Stokes formulas via minimal resolutions (Q1003649) (← links)
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) (Q1003771) (← links)
- On colorings of graph powers (Q1043947) (← links)
- A local characterization of the Johnson scheme (Q1107538) (← links)
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- Homotopy type of neighborhood complexes of Kneser graphs, \(KG_{2,k}\) (Q1630242) (← 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)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← 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)
- On graphs with a large chromatic number that contain no small odd cycles (Q1930215) (← 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 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- Generalised Mycielski graphs and the Borsuk-Ulam theorem (Q2327221) (← links)
- Colouring quadrangulations of projective spaces (Q2347842) (← links)
- The automorphism group of the \(s\)-stable Kneser graphs (Q2360724) (← links)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- A new coloring theorem of Kneser graphs (Q2431265) (← links)
- Critical graphs without triangles: an optimum density construction (Q2439835) (← links)
- Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
- Combinatorial Stokes formulae (Q2462340) (← links)
- On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs (Q2659208) (← links)
- Edge-critical subgraphs of Schrijver graphs. II: The general case (Q2664563) (← links)
- Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
- On directed local chromatic number, shift graphs, and Borsuk-like graphs (Q3067063) (← links)
- Multi-coloring the Mycielskian of graphs (Q3553236) (← links)
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property (Q3604997) (← links)
