Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (Q2514227): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1528271184 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q41889455 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1209.4879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonpolyhedral Triangulated Mobius Strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Embeddings of Polyhedra In Codimension Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for geometric hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4753232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of embedding simplicial complexes in \(\mathbb R^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heawood inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some minimal nonembeddable complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on cyclic polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic lower bounds for Ramsey functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724086 / rank
 
Normal rank

Latest revision as of 14:55, 9 July 2024

scientific article
Language Label Description Also known as
English
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
scientific article

    Statements

    Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    hypergraphs
    0 references
    coloring
    0 references
    chromatic number
    0 references
    embeddings
    0 references
    four color theorem
    0 references

    Identifiers