Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:iris.uniroma1.it:11573/1472466

A construction for clique-free pseudorandom graphs

Authors
Publication date
1 January 2020
Publisher
Springer
Doi

    Abstract

    A construction of Alon and Krivelevich gives highly pseudorandom Kk-free graphs on n vertices with edge density equal to Θ(n−1=(k−2)). In this short note we improve their result by constructing an infinite family of highly pseudorandom Kk-free graphs with a higher edge density of Θ(n−1=(k−1))

    Similar works

    Full text

    thumbnail-image

    Archivio della ricerca- Università di Roma La Sapienza

    redirect
    oaioai:iris.uniroma1.it:11573/147...
    Last time updated on 18/11/2021

    This paper was published in Archivio della ricerca- Università di Roma La Sapienza.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.