A Construction for Clique-Free Pseudorandom Graphs

Anurag Bishnoi; Ferdinand Ihringer; Valentina Pepe

doi:10.1007/s00493-020-4226-6

A Construction for Clique-Free Pseudorandom Graphs

Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

74 Downloads (Pure)

Abstract

A construction of Alon and Krivelevich gives highly pseudorandom K_k-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 K_k-free graphs with a higher edge density of Θ(n^−1=(k−1)).

Original language	English
Pages (from-to)	307-314
Number of pages	8
Journal	Combinatorica
Volume	40
Issue number	3
DOIs	https://doi.org/10.1007/s00493-020-4226-6
Publication status	Published - 1 Jun 2020

Access to Document

10.1007/s00493-020-4226-6

Bishnoi, et al., 2019 Construction for clique-free pseudorandomAccepted author manuscript, 253 KB

Cite this

@article{1cac0d743b0e4fe0931bb926a968a916,

title = "A Construction for Clique-Free Pseudorandom Graphs",

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)).",

author = "Anurag Bishnoi and Ferdinand Ihringer and Valentina Pepe",

year = "2020",

month = jun,

day = "1",

doi = "10.1007/s00493-020-4226-6",

language = "English",

volume = "40",

pages = "307--314",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "3",

}

TY - JOUR

T1 - A Construction for Clique-Free Pseudorandom Graphs

AU - Bishnoi, Anurag

AU - Ihringer, Ferdinand

AU - Pepe, Valentina

PY - 2020/6/1

Y1 - 2020/6/1

N2 - 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)).

AB - 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)).

UR - http://www.scopus.com/inward/record.url?scp=85081605257&partnerID=8YFLogxK

U2 - 10.1007/s00493-020-4226-6

DO - 10.1007/s00493-020-4226-6

M3 - Article

AN - SCOPUS:85081605257

SN - 0209-9683

VL - 40

SP - 307

EP - 314

JO - Combinatorica

JF - Combinatorica

IS - 3

ER -

A Construction for Clique-Free Pseudorandom Graphs

Abstract

Access to Document

Other files and links

Fingerprint

Extremal combinatorics meets finite geometry

Cite this

A Construction for Clique-Free Pseudorandom Graphs

Abstract

Access to Document

Other files and links

Fingerprint

Projects

Extremal combinatorics meets finite geometry

Cite this