Pages that link to "Item:Q755592"
From MaRDI portal
The following pages link to Kneser's conjecture, chromatic number, and homotopy (Q755592):
Displaying 50 items.
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
- (Q5092401) (← links)
- A Result on Polynomials Derived Via Graph Theory (Q5108595) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Hajós-Type Constructions and Neighborhood Complexes (Q5139660) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
- Noncommutative network models (Q5220180) (← links)
- On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← links)
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- Hom complexes and homotopy in the category of graphs (Q5300996) (← links)
- CORES OF SYMMETRIC GRAPHS (Q5322910) (← links)
- Deformation retracts of neighborhood complexes of stable Kneser graphs (Q5398117) (← links)
- Tight LP‐based lower bounds for wavelength conversion in optical networks (Q5422017) (← links)
- Equipartitions of measures in $\mathbb{R}^4$ (Q5423902) (← links)
- (Q5870293) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- Triangle-free subgraphs with large fractional chromatic number (Q5886312) (← links)
- The chromatic profile of locally colourable graphs (Q5886349) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5890906) (← links)
- A generalization of Kneser's conjecture (Q5891501) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5895045) (← links)
- Quadratic forms on graphs (Q5896810) (← links)
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler (Q5917516) (← links)
- Morphism complexes of sets with relations (Q5964057) (← links)
- Vertex cut of a graph and connectivity of its neighbourhood complex (Q6041558) (← links)
- On the connectivity of the disjointness graph of segments of point sets in general position in the plane (Q6045406) (← links)
- The Neighborhood Polynomial of Chordal Graphs (Q6045410) (← links)
- A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs (Q6047961) (← links)
- Colorings of complements of line graphs (Q6056781) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
- The core of a complementary prism (Q6083960) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)
- Local orthogonality dimension (Q6094036) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- Concerning a conjecture on matching Kneser graphs (Q6124424) (← links)
- On the diameter of Schrijver graphs (Q6126715) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
- Orthogonality spaces associated with posets (Q6139860) (← links)
- On the number of star‐shaped classes in optimal colorings of Kneser graphs (Q6143383) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q6161696) (← links)
- (Q6165487) (← links)
- Total dominator chromatic number of Kneser graphs (Q6166235) (← links)
- Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian (Q6184321) (← links)
- Treewidth of the \(q\)-Kneser graphs (Q6184322) (← links)
