Pages that link to "Item:Q3743337"

The following pages link to The Chromatic Number of Kneser Hypergraphs (Q3743337):

Displaying 30 items.

• Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
• WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences (Q2566802) (← links)
• Hedetniemi's conjecture from the topological viewpoint (Q2680825) (← links)
• Lower bounds for the chromatic number of certain Kneser-type hypergraphs (Q2700974) (← links)
• Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q2701005) (← links)
• Compact representations of the intersection structure of families of finite sets (Q2706199) (← links)
• Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
• (Q3360893) (← links)
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property (Q3604997) (← links)
• Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
• Problems and results on 3-chromatic hypergraphs and some related questions (Q4074927) (← links)
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH (Q4103571) (← links)
• On the chromatic number of Kneser hypergraphs (Q4330574) (← links)
• (Q4346810) (← links)
• Partition-Crossing Hypergraphs (Q4584655) (← links)
• Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
• Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
• On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell (Q4697504) (← links)
• On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)
• On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
• On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)
• A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs (Q6047961) (← links)
• On the number of star‐shaped classes in optimal colorings of Kneser graphs (Q6143383) (← links)
• Total dominator chromatic number of Kneser graphs (Q6166235) (← links)
• Homotopy and Hom construction in the category of finite hypergraphs (Q6166662) (← links)
• Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
• Monochromatic spanning trees and matchings in ordered complete graphs (Q6199379) (← links)
• A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs (Q6568845) (← links)
• Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023 (Q6613402) (← links)
• Ramsey numbers for multiple copies of hypergraphs (Q6650727) (← links)