A generalization of Kneser graphs
From MaRDI portal
Publication:2191979
Recommendations
- Kneser representations of graphs
- On the diameter of generalized Kneser graphs
- Path decompositions of Kneser and generalized Kneser graphs
- scientific article; zbMATH DE number 7731184
- The odd girth of the generalised Kneser graph
- Treewidth of the generalized Kneser graphs
- A generalization of Pappus graph
- Extremal problems concerning Kneser-graphs
- Kirszbraun-type theorems for graphs
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs
Cites work
- A size-sensitive inequality for cross-intersecting families
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Combinatorial geometry and coding theory
- Counting intersecting and pairs of cross-intersecting families
- Diversity of uniform intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Extremal problems in hypergraph colourings
- Families of vectors without antipodal pairs
- Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems with geometric consequences
- Kneser's conjecture, chromatic number, and homotopy
- Lovász' theorem on the chromatic number of spheres revisited
- New inequalities for families without \(k\) pairwise disjoint members
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- On a bound in extremal combinatorics
- On chromatic numbers of close-to-Kneser distance graphs
- On lower bounds for the chromatic number of sphere
- On random subgraphs of Kneser and Schrijver graphs
- On random subgraphs of Kneser graphs and their generalizations
- On the chromatic number of a random subgraph of the Kneser graph
- On the chromatic numbers of low-dimensional spaces
- On the chromatic numbers of some distance graphs
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the colouring of spheres embedded in R^n
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- On the stability of the Erdős-Ko-Rado theorem
- Random Kneser graphs and hypergraphs
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- Regular bipartite graphs and intersecting families
- Uniform s-Cross-Intersecting Families
- 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
Cited in
(28)- A survey on Knödel graphs.
- Chromatic number via Turán number
- Bounds on Borsuk numbers in distance graphs of a special type
- On the chromatic number of two generalized Kneser graphs
- New Turán type bounds for Johnson graphs
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- Treewidth of the generalized Kneser graphs
- On Ramsey numbers for arbitrary sequences of graphs
- On the minimal number of edges in induced subgraphs of special distance graphs
- On stability of the independence number of a certain distance graph
- On dividing sets into parts of smaller diameter
- Variants of k-regular nearest neighbor graph and their construction
- On chromatic numbers of close-to-Kneser distance graphs
- On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
- scientific article; zbMATH DE number 5994660 (Why is no real title available?)
- Kneser representations of graphs
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
- Unraveling k-page graphs
- scientific article; zbMATH DE number 1993726 (Why is no real title available?)
- On chromatic number of general Kneser graphs
- A GENERALISATION OF HIGHER-RANK GRAPHS
- scientific article; zbMATH DE number 3235079 (Why is no real title available?)
- scientific article; zbMATH DE number 4189769 (Why is no real title available?)
- The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications
- Modularity of some distance graphs
- Vertex stress related parameters for certain Kneser graphs
- On the diameter and connectivity of bipartite Kneser type-k graphs
- On the parameters of symmetric difference bipartite graphs
This page was built for publication: A generalization of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2191979)
