Skip to main content Accessibility help
×
Home
Hostname: page-component-5bf98f6d76-xcz5z Total loading time: 0.323 Render date: 2021-04-20T17:55:10.652Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Almost all Berge Graphs are Perfect

Published online by Cambridge University Press:  12 September 2008

Hans Jürgen Prömel
Affiliation:
Institut für Diskrete Mathematik, Universität Bonn, Nassestr. 2, 5300 Bonn, Germany
Angelika Steger
Affiliation:
Institut für Diskrete Mathematik, Universität Bonn, Nassestr. 2, 5300 Bonn, Germany

Abstract

Let Per f(n) denote the set of all perfect graphs on n vertices and let Berge(n) denote the set of all Berge graphs on n vertices. The strong perfect graph conjecture states that Per f(n) = Berge(n) for all n. In this paper we prove that this conjecture is at least asymptotically true, i.e. we show that

Type
Research Article
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below.

References

[1] Bruijn, N. G. De. Asymptotic Methods in Analysis. North-Holland Publishing, Amsterdam, 1958.Google Scholar
[2] Erdős, P., Kleitman, D. J. and Rothschild, B. L.. Asymptotic enumeration of Kn—free graphs. In International Colloquium on Combinatorial Theory. Atti dei Convegni Lincei 17, Vol. 2, Rome, pp. 1927, (1976).Google Scholar
[3] Hayward, R.. Weakly triangulated graphs. J. Combin. Theory, Series B 39 pp. 200209, (1985).CrossRefGoogle Scholar
[4] Kleitman, D. J. and Rothschild, B. L.. Asymptotic enumeration of partial orders on a finite set. Trans. Amer. Math. Soc. 205 pp. 205220, (1975).CrossRefGoogle Scholar
[5] Kolaitis, Ph.G., Prömel, H. J. and Rothschild, B. L.. K1+1-free graphs: asymptotic structure and a 0–1–law. Trans. Amer. Math. Soc. 303 pp. 637671, (1987).Google Scholar
[6] Prömel, H. J. and Steger, A.. Excluding induced subgraphs: quadrilaterals. Random Struct. Alg. 2, pp. 5571, (1991).CrossRefGoogle Scholar
[7] Prömel, H. J. and Steger, A.. Excluding induced subgraphs III: a general asymptotic. Random Struct. Alg. 3, pp. 1931, (1992).CrossRefGoogle Scholar
[8] Prömel, H. J. and Steger, A.. Random l-colorable graphs. Forschungsinstitut für Diskrete Mathe-matik, Universität Bonn, 1992.Google Scholar
[9] Szemerédi, E.. Regular partitions of graphs. In Problémes en combinatoire et théorie des graphes C.N.R.S., Paris, pp. 399401, (1978).Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 51 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 20th April 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Almost all Berge Graphs are Perfect
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Almost all Berge Graphs are Perfect
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Almost all Berge Graphs are Perfect
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *