Pages that link to "Item:Q755592"

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

Displaying 50 items.

• A combinatorial proof of the Borsuk-Ulam antipodal point theorem (Q1123437) (← links)
• A note on induced cycles in Kneser graphs (Q1180426) (← links)
• The colored Tverberg's problem and complexes of injective functions (Q1200006) (← links)
• A generalization of the ham sandwich theorem (Q1206255) (← links)
• Helly property in finite set systems (Q1208035) (← links)
• A short proof of Kneser's conjecture (Q1256485) (← links)
• Long induced paths and cycles in Kneser graphs (Q1263600) (← links)
• The algebra of flows in graphs (Q1276390) (← links)
• Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François) (Q1296153) (← links)
• Strong products of Kneser graphs (Q1336712) (← links)
• A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
• The order dimension of two levels of the Boolean lattices (Q1337568) (← links)
• Tiling Hamming space with few spheres (Q1374207) (← links)
• Circular chromatic number of Kneser graphs (Q1400965) (← links)
• Vertex embeddings of regular polytopes (Q1425689) (← links)
• Graph products and the chromatic difference sequence of vertex-transitive graphs (Q1584242) (← links)
• The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
• On endo-homology of complexes of graphs (Q1584335) (← links)
• Generalized Kneser coloring theorems with combinatorial proofs (Q1608563) (← 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)
• Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
• Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
• Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
• A topological lower bound for the chromatic number of a special family of graphs (Q1686007) (← links)
• On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result (Q1686405) (← links)
• New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
• Altermatic number of categorical product of graphs (Q1709531) (← links)
• On the generalized Erdős-Kneser conjecture: proofs and reductions (Q1719585) (← links)
• Independence number of products of Kneser graphs (Q1727773) (← links)
• The chromatic number of the \(q\)-Kneser graph for large \(q\) (Q1733933) (← links)
• Homotopy type of the neighborhood complexes of graphs of maximal degree at most 3 and 4-regular circulant graphs (Q1740361) (← links)
• On multicolor Ramsey numbers for loose \(k\)-paths of length three (Q1750208) (← links)
• A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
• \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
• Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) (Q1752691) (← links)
• Neighborhood and domination polynomials of graphs (Q1756089) (← links)
• Topology of Hom complexes and test graphs for bounding chromatic number (Q1758983) (← links)
• Extreme amenability of abelian \(L_0\) groups (Q1762332) (← links)
• Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
• Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
• On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
• Stable sets of maximal size in Kneser-type graphs (Q1827339) (← links)
• NP-completeness of a family of graph-colouring problems (Q1835680) (← links)
• Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini (Q1835683) (← links)
• From graphs to ortholattices and equivariant maps (Q1838501) (← links)
• Nearly bipartite graphs with large chromatic number (Q1839258) (← links)
• 4-chromatic graphs with large odd girth (Q1842185) (← links)
• Transversal numbers for hypergraphs arising in geometry (Q1865252) (← links)