Abstract
The paper considers a special chapter of the theory of asymptotic methods in enumeration. While the general theory has been covered by an excellent exposition of Bender [1], we mainly consider relative frequencies for relational systems of a special kind within a general class of configurations. We give a survey of results and try to emphasize the intuitive ideas behind the formal results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.A. Bender, Asymptotic methods in enumeration. SIAM review 16 (1974), 485–515.
A. Blass and F. Harary, Properties of almost all graphs and complexes. Jour.graph theory 3 (1979), 225–240.
B. Bollobás, Graph theory. Springer, New York, Heidelberg, Berlin (1979).
B. Bollobás and P. Erdös, Cliques in random graphs. Math.proc.Cambridge phil.soc. 80 (1976), 419–427.
K.J.Compton, Application of logic to finite combinatorics. Dissertation Wesleyan Univ., Middletown (1981) (unpublished manuscript).
P. Erdös and A. Rényi, On the evolution of random graphs. Publ.math. inst. Hungar. acad. sciences 5 (1960), 17–61.
P. Erdös and J. Spencer, Probabilistic methods in combinatorics. Academic Press New York, London (1974).
G. Exoo, On a adjacencyproperty of graphs. Jour. graph theory 5 (1981), 371–378.
R. Fagin, Probabilities on finite models. Jour. Symb. Logic 41 (1976), 50–58.
F. Harary and E.M. Palmer, Graphical enumeration. Academic Press New York, London (1973).
D.J. Kleitman and B.L. Rothschild, Asymptotic enumeration of partial orders on a finite set. Trans. AMS 205 (1975), 205–220.
A.D. Korshunov, Solution to a problem of Erdös and Rényi on Hamilton cycles in nonoriented graphs. Soviet Math. Doklady 17 (1976), 760–764.
J.F. Lynch, Almost sure theories. Ann.math.logic 18 (1980), 91–135.
J.W. Moon, Almost all graphs have a spanning cycle. Canad.math.bull. 15 (1972), 39–41.
L. Moser and M. Wyman, An asymptotic formula for the Bell numbers. Trans. roy. Canad. soc. 49, ser. III (1955), 49–54.
W. Oberschelp Kombinatorische Anzahlbestimmungen in Relationen. Math. Annalen 174 (1967), 53–78.
W. Oberschelp, Monotonicity for structure numbers in theories without identity. In: Lecture notes in math. 579 (1977), 297–308.
W. Oberschelp, Asymptotische 0–1 Anzahlformeln für prädikatenlogisch definierte Modellklassen. Manuscript unpublished. Abstract in: Deutsche Math.Vereinigung, Vorträge Univ. Dortmund 1980, p.162.
E.M. Wright, Graphs on unlabelled nodes with a given number of edges. Acta Math. 168 (1971), 1–9.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Oberschelp, W. (1982). Asymptotic 0–1 laws in combinatorics. In: Jungnickel, D., Vedder, K. (eds) Combinatorial Theory. Lecture Notes in Mathematics, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0063000
Download citation
DOI: https://doi.org/10.1007/BFb0063000
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11971-5
Online ISBN: 978-3-540-39380-1
eBook Packages: Springer Book Archive