Pages that link to "Item:Q755592"

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

Displaying 50 items.

• Edge-critical subgraphs of Schrijver graphs. II: The general case (Q2664563) (← links)
• Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs (Q2673495) (← links)
• Hedetniemi's conjecture from the topological viewpoint (Q2680825) (← links)
• On the boxicity of Kneser graphs and complements of line graphs (Q2689506) (← links)
• Geodetic convexity and Kneser graphs (Q2698271) (← links)
• Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q2701005) (← links)
• Fractional chromatic numbers of cones over graphs (Q2757095) (← links)
• Proof of the middle levels conjecture (Q2809275) (← links)
• On homometric sets in graphs (Q2857323) (← links)
• On the circular chromatic number of graph powers (Q2874089) (← links)
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER (Q2971041) (← 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)
• The chromatic Ramsey number of odd wheels (Q3113290) (← links)
• Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
• Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
• On maximal isolation sets in the uniform intersection matrix (Q3300704) (← links)
• The existence of a near-unanimity term in a finite algebra is decidable (Q3399189) (← links)
• Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
• Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
• Topological methods in combinatorial problems (Q3475928) (← links)
• Multi-coloring the Mycielskian of graphs (Q3553236) (← links)
• Colinear Coloring on Graphs (Q3605491) (← links)
• Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
• Homology as a Tool in Integer Programming (Q3714903) (← links)
• The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
• Borsuk's theorem through complementary pivoting (Q3890454) (← links)
• Orthogonal partitions and covering of graphs (Q3904638) (← links)
• On the chromatic number of Kneser hypergraphs (Q4330574) (← links)
• Codimension Two and Three Kneser Transversals (Q4568090) (← links)
• COLORING CURVES ON SURFACES (Q4584908) (← links)
• Schrijver Graphs and Projective Quadrangulations (Q4604387) (← links)
• Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
• Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
• Topological obstructions to graph colorings (Q4680992) (← links)
• Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
• On graphs with strongly independent color-classes (Q4736765) (← links)
• Discretized configurations and partial partitions (Q4907138) (← links)
• Decompositions into Subgraphs of Small Diameter (Q4911111) (← links)
• NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors (Q5002681) (← links)
• Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
• Achromatic numbers of Kneser graphs (Q5013343) (← links)
• An infinite family of incidence geometries whose incidence graphs are locally X (Q5041808) (← links)
• Counterexamples to a conjecture on matching Kneser graphs (Q5046003) (← links)
• A note on fractional covers of a graph (Q5058159) (← links)
• Subgraphs of Kneser graphs with large girth and large chromatic number (Q5058217) (← links)
• Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
• (Q5088983) (← links)