Pages that link to "Item:Q755592"

The following pages link to Kneser's conjecture, chromatic number, and homotopy (Q755592):

Displaying 50 items.

• Homomorphism complexes and \(k\)-cores (Q724876) (← links)
• Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
• Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
• A generalized Kneser conjecture (Q750443) (← links)
• Häggkvist-Hell graphs: A class of Kneser-colorable graphs (Q764869) (← links)
• On the locating chromatic number of Kneser graphs (Q765319) (← links)
• \(b\)-coloring of Kneser graphs (Q765331) (← links)
• Edge-critical subgraphs of Schrijver graphs (Q777487) (← links)
• A note on the Poljak-Rödl function (Q782938) (← links)
• Covering radius and the chromatic number of Kneser graphs (Q805622) (← links)
• Colouring lines in projective space (Q817609) (← links)
• Topological graph persistence (Q827588) (← links)
• The neighborhood polynomial of chordal graphs (Q832856) (← links)
• A short proof of \(w_{1}^n (\text{Hom}(C_{2r+1}, K_{n+2})) = 0\) for all \(n\) and a graph colouring theorem by Babson and Kozlov (Q839909) (← links)
• Topology and combinatorics of partitions of masses by hyperplanes (Q855777) (← links)
• The neighborhood complex of a random graph (Q868889) (← links)
• Density and power graphs in graph homomorphism problem (Q932664) (← links)
• Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
• Homotopy types of box complexes (Q949758) (← links)
• The genus of \(G\)-spaces and topological lower bounds for chromatic numbers of hypergraphs (Q950736) (← links)
• On the topological lower bound for the multichromatic number (Q965996) (← links)
• Homotopy types of box complexes of chordal graphs (Q966142) (← links)
• On the b-chromatic number of Kneser graphs (Q968135) (← links)
• On finite simple groups and Kneser graphs. (Q968241) (← links)
• Circular coloring and Mycielski construction (Q968430) (← links)
• Symmetries of the stable Kneser graphs (Q972851) (← links)
• The universality of Hom complexes of graphs (Q987561) (← links)
• Local coloring of Kneser graphs (Q998322) (← links)
• Hom complexes and homotopy theory in the category of graphs (Q1003603) (← links)
• Topological obstructions for vertex numbers of Minkowski sums (Q1003631) (← links)
• Homotopy groups of Hom complexes of graphs (Q1003632) (← links)
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) (Q1003771) (← links)
• Combinatorial groupoids, cubical complexes, and the Lovász Conjecture (Q1006398) (← links)
• Colorful flowers (Q1013831) (← links)
• Large disjoint subgraphs with the same order and size (Q1024273) (← links)
• Vizing's conjecture for chordal graphs (Q1024500) (← links)
• Graph colorings, spaces of edges and spaces of circuits (Q1028347) (← links)
• On colorings of graph powers (Q1043947) (← links)
• On \(b\)-coloring of the Kneser graphs (Q1043965) (← links)
• A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
• Extremal problems concerning Kneser-graphs (Q1057858) (← links)
• Hamiltonian uniform subset graphs (Q1071032) (← links)
• Large independent sets in shift-invariant graphs (Q1100485) (← links)
• A class of additive multiplicative graph functions (Q1103643) (← links)
• The chromatic connectivity of graphs (Q1110536) (← links)
• The complexity of multicolouring (Q1113919) (← links)
• Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
• On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
• On locally-perfect colorings (Q1121900) (← links)
• A certain combinatorial inequality (Q1121902) (← links)