The Chromatic Number of Kneser Hypergraphs
From MaRDI portal
Publication:3743337
Recommendations
- Extremal problems concerning Kneser-graphs
- scientific article; zbMATH DE number 4075095
- On the chromatic number of generalized Kneser hypergraphs
- Lower bounds for the chromatic number of certain Kneser-type hypergraphs
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
Cites work
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- A short proof of Kneser's conjecture
- Bisection of Circle Colorings
- Extremal problems concerning Kneser-graphs
- Homotopy properties of greedoids
- scientific article; zbMATH DE number 3845607 (Why is no real title available?)
- scientific article; zbMATH DE number 15490 (Why is no real title available?)
- scientific article; zbMATH DE number 736297 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- Hypergraphs do not jump
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Kneser's conjecture, chromatic number, and homotopy
- On a Topological Generalization of a Theorem of Tverberg
- On complete subgraphs of different orders
- On intersecting families of finite sets
- On the chromatic number of the general Kneser-graph
- On the imbedding of systems of compacta in simplicial complexes
- On the theory of graphs
- Splitting necklaces
- Supersaturated graphs and hypergraphs
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- The Ramsey number for stripes
Cited in
(92)- Combinatorial Stokes formulas via minimal resolutions
- Large disjoint subgraphs with the same order and size
- Extremal problems concerning Kneser-graphs
- On a packing and covering problem
- Hypergraphs without a large star
- Splitting necklaces
- Exact solution of some Turán-type problems
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
- The multichromatic numbers of some Kneser graphs
- Vertex covering with monochromatic pieces of few colours
- Chromatic number of random Kneser hypergraphs
- On the generalized Erdős-Kneser conjecture: proofs and reductions
- On multicolor Ramsey numbers for loose \(k\)-paths of length three
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Ramsey numbers for partially-ordered sets
- On the chromatic number of a subgraph of the Kneser graph
- Box complexes, neighborhood complexes, and the chromatic number
- On characterizing the critical graphs for matching Ramsey numbers
- Chromatic number via Turán number
- Choice number of Kneser graphs
- Sharp bounds for the chromatic number of random Kneser graphs
- Fair splittings by independent sets in sparse graphs
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
- On the chromatic number of generalized Kneser graphs and Hadamard matrices
- A note on homomorphisms of Kneser hypergraphs
- Matchings with few colors in colored complete graphs and hypergraphs
- Clique chromatic numbers of intersection graphs
- On the chromatic number of generalized Kneser hypergraphs
- Complexes of graph homomorphisms
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Multicolor Ramsey numbers for triple systems
- Colorful subgraphs in Kneser-like graphs
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- Hedetniemi's conjecture from the topological viewpoint
- Lower bounds for the chromatic number of certain Kneser-type hypergraphs
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Compact representations of the intersection structure of families of finite sets
- On random subgraphs of Kneser and Schrijver graphs
- Intersection patterns of finite sets and of convex sets
- A combinatorial proof for the circular chromatic number of Kneser graphs
- scientific article; zbMATH DE number 4214034 (Why is no real title available?)
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
- Local chromatic number and distinguishing the strength of topological obstructions
- scientific article; zbMATH DE number 4075095 (Why is no real title available?)
- Hom complexes and hypergraph colorings
- scientific article; zbMATH DE number 176203 (Why is no real title available?)
- Colorful subhypergraphs in Kneser hypergraphs
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Hypergraphs with many Kneser colorings
- On the chromatic number of Kneser hypergraphs
- scientific article; zbMATH DE number 1043908 (Why is no real title available?)
- Partition-crossing hypergraphs
- Coloring properties of categorical product of general Kneser hypergraphs
- Tverberg’s theorem is 50 years old: A survey
- On graphs with prescribed subgraphs of order k, and a theorem of Kelly and Merriell
- On the chromatic number of general Kneser hypergraphs
- Colorful subhypergraphs in uniform hypergraphs
- On the chromatic number of matching Kneser graphs
- On the multichromatic number of \(s\)-stable Kneser graphs
- Hedetniemi's conjecture for Kneser hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- The chromatic number of almost stable Kneser hypergraphs
- A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs
- On the number of star‐shaped classes in optimal colorings of Kneser graphs
- Transversals to the convex hulls of all k-sets of discrete subsets of R^n
- Total dominator chromatic number of Kneser graphs
- Homotopy and Hom construction in the category of finite hypergraphs
- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Monochromatic spanning trees and matchings in ordered complete graphs
- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
- Ramsey numbers for multiple copies of hypergraphs
- Random Kneser graphs and hypergraphs
- Tight Hamilton cycles with high discrepancy
- Topological methods in zero-sum Ramsey theory
- An invariance principle for the multi-slice, with applications
- The chromatic number of Kneser hypergraphs via consensus division
- The de Bruijn-Erdős theorem for hypergraphs
- Graph theory. Abstracts from the workshop held January 5--10, 2025
- Regarding equitable colorability defect of hypergraphs
- The chromatic number of Kneser hypergraphs via consensus division
- Box complexes: at the crossroad of graph theory and topology
- Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
- Topology of total cut complexes and cut complexes of grid graphs
- Chromatic Ramsey number of acyclic hypergraphs
- A generalized Kneser conjecture
- Kneser's conjecture, chromatic number, and homotopy
- Ein Zerlegungssatz für P( )
- On generalized Kneser hypergraph colorings
- Smallest set-transversals of \(k\)-partitions
This page was built for publication: The Chromatic Number of Kneser Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3743337)
