Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128071844, #quickstatements; #temporary_batch_1723902436788
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Danila Cherkashin / rank
Normal rank
 
Property / author
 
Property / author: Danila Cherkashin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963036780 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1805.09394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the girth and diameter of generalized Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chromatic Number of Kneser Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / 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: On the diameter of generalized Kneser graphs / 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 number of the general Kneser-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems concerning Kneser-graphs / 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: Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of vectors without Antipodal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algebraic topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / 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: On the chromatic number of Kneser hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorical proof of Kneser's conjecture / 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: Six Standard Deviations Suffice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique chromatic numbers of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kneser coloring theorems with combinatorial proofs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128071844 / rank
 
Normal rank

Latest revision as of 16:09, 17 August 2024

scientific article
Language Label Description Also known as
English
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
scientific article

    Statements

    Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    Kneser graphs
    0 references
    Hadamard matrices
    0 references
    0 references
    0 references
    0 references