A generalization of Kneser graphs (Q2191979): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
Normal rank
 
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a random subgraph of the Kneser graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser graphs and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lovász' theorem on the chromatic number of spheres revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser and Schrijver graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Kneser graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic numbers of close-to-Kneser distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the colouring of spheres embedded in $ \mathbb R^n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for the chromatic number of sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of small-dimensional Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of low-dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bound in extremal combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in a uniform hypergraph with a range of permitted intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of vectors without Antipodal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in hypergraph colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversity of uniform intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inequalities for families without \(k\) pairwise disjoint members / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs and intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Intersecting and Pairs of Cross-Intersecting Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A size-sensitive inequality for cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform <i>s</i>-Cross-Intersecting Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0001434620030037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3019715005 / rank
 
Normal rank

Latest revision as of 09:30, 30 July 2024

scientific article
Language Label Description Also known as
English
A generalization of Kneser graphs
scientific article

    Statements

    A generalization of Kneser graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2020
    0 references
    Kneser's conjecture
    0 references
    Kneser graphs
    0 references
    topological method
    0 references

    Identifiers