Pages that link to "Item:Q755592"

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

Displaying 50 items.

• Covering by intersecting families (Q1881681) (← links)
• Box complexes, neighborhood complexes, and the chromatic number (Q1881691) (← links)
• Coloring graph products---a survey (Q1923489) (← links)
• Partitions of nonzero elements of a finite field into pairs (Q1932655) (← links)
• Ideals of graph homomorphisms (Q1950425) (← links)
• Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
• The \(p\)-restricted edge-connectivity of Kneser graphs (Q2008197) (← links)
• Neighborhood complexes of Cayley graphs with generating set of size two (Q2008589) (← links)
• Spectral gap bounds for the simplicial Laplacian and an application to random complexes (Q2010629) (← links)
• Chromatic number via Turán number (Q2012520) (← links)
• Coloring graphs by translates in the circle (Q2033887) (← links)
• The toughness of Kneser graphs (Q2037560) (← links)
• First-order complexity of subgraph isomorphism via Kneser graphs (Q2037624) (← links)
• On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
• Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) (← links)
• On the treewidth of Hanoi graphs (Q2077387) (← links)
• The complexity of finding fair independent sets in cycles (Q2087771) (← links)
• On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs (Q2096273) (← links)
• Neighborhood hypergraph model for topological data analysis (Q2111089) (← links)
• Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
• Fractional cocoloring of graphs (Q2117529) (← links)
• Distributed algorithms for fractional coloring (Q2117704) (← links)
• Treewidth of the generalized Kneser graphs (Q2121803) (← links)
• Clique number of Xor products of Kneser graphs (Q2138983) (← links)
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
• Aspects of topological approaches for data science (Q2148960) (← links)
• The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188) (← links)
• On Vietoris-Rips complexes of hypercube graphs (Q2151730) (← links)
• Choice number of Kneser graphs (Q2166315) (← links)
• On total and edge coloring some Kneser graphs (Q2168715) (← links)
• Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
• The geometry and combinatorics of discrete line segment hypergraphs (Q2174575) (← links)
• Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
• On semi-transitive orientability of Kneser graphs and their complements (Q2185911) (← links)
• A generalization of Kneser graphs (Q2191979) (← links)
• Proof of Stahl's conjecture in some new cases (Q2197410) (← links)
• The graphs behind reuleaux polyhedra (Q2207609) (← links)
• On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
• On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs (Q2221931) (← links)
• On weak \(\epsilon\)-nets and the Radon number (Q2223615) (← links)
• Vanishing of all equivariant obstructions and the mapping degree (Q2230928) (← links)
• Neighborhood complexes and Kronecker double coverings (Q2231247) (← links)
• A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
• A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function (Q2278108) (← links)
• On the Hadwiger number of Kneser graphs and their random subgraphs (Q2278635) (← links)
• A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) (Q2279276) (← links)
• On the chromatic number of generalized Kneser graphs and Hadamard matrices (Q2280005) (← links)
• A note on homomorphisms of Kneser hypergraphs (Q2284780) (← links)
• Exact distance graphs of product graphs (Q2287747) (← links)
• Dold's theorem from viewpoint of strong compatibility graphs (Q2297921) (← links)