Enumeration of Full Graphs: Onset of the Asymptotic Region

DOI10.1002/SAPM1996963339zbMATH Open0853.05048OpenAlexW2284413816MaRDI QIDQ4884436FDOQ4884436

Authors

Publication date 9 December 1996

Published in Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sapm1996963339

zbMATH Keywords

enumerationfull graphdominant class

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Recommendations

• Asymptotic enumeration of full graphs
• scientific article; zbMATH DE number 747033
• scientific article; zbMATH DE number 1043862
• Full subgraphs

Cites work

• Asymptotic Enumeration of Partial Orders on a Finite Set
• Asymptotic enumeration of full graphs
• Counting finite posets and topologies
• Incidence matrices and interval graphs
• The visually distinct configurations of k sets

Cited in

(2)

• Asymptotic enumeration of full graphs
• Isabelle formalisation of original representation theorems

This page was built for publication: Enumeration of Full Graphs: Onset of the Asymptotic Region

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884436)