On the expected number of perfect matchings in cubic planar graphs (Q2075311): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 2005.13821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of perfect matchings in graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting colored planar maps: algebraicity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse graphs: Metrics and random models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of matchings in random regular graphs and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generating function of planar Eulerian orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in planar cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal singular exponents in catalytic variable equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinear bound on the number of perfect matchings in cubic bridgeless graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting surfaces. CRM Aisenstadt chair lectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of rooted cubic planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration and limit laws of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs on surfaces and their applications. Appendix by Don B. Zagier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Tree-Rooted Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of labelled 4‐regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on random cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GFUN / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Planar Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Hamiltonian Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Planar Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2897215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting rooted maps by genus. III: Nonseparable maps / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205894310 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article
Language Label Description Also known as
English
On the expected number of perfect matchings in cubic planar graphs
scientific article

    Statements

    On the expected number of perfect matchings in cubic planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2022
    0 references
    asymptotic enumeration
    0 references
    planar graphs
    0 references
    regular graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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