Lower bounds on the maximum number of non-crossing acyclic graphs (Q2346577): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979048780 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.5882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pseudo-triangulations of certain point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / 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: Analytic combinatorics of non-crossing configurations / 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: Counting Plane Graphs: Flippability and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755077 / rank
 
Normal rank

Latest revision as of 04:42, 10 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on the maximum number of non-crossing acyclic graphs
scientific article

    Statements

    Identifiers