Point sets with many non-crossing perfect matchings (Q1699275): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1502.04925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of plane geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic analytic combinatorics of directed lattice paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Maximum Multiplicity of Some Common Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of Enumerative Geometry: Congruences and Asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossing‐Free Matchings, Cycles, and Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vassiliev invariants and a strange identity related to the Dedekind eta-function / rank
 
Normal rank

Latest revision as of 03:59, 15 July 2024

scientific article
Language Label Description Also known as
English
Point sets with many non-crossing perfect matchings
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references