On the rectilinear crossing number of complete uniform hypergraphs (Q2362105): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102159402 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.01335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the crossing number of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Radon partitions for cyclic polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for geometric hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational search of small point sets with small rectilinear crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph crossing number and its variants: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657594 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:51, 14 July 2024

scientific article
Language Label Description Also known as
English
On the rectilinear crossing number of complete uniform hypergraphs
scientific article

    Statements

    On the rectilinear crossing number of complete uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    5 July 2017
    0 references
    crossing simplices
    0 references
    Ham-Sandwich theorem
    0 references
    Gale transform
    0 references
    moment curve
    0 references

    Identifiers