Loading...
Please wait, while we are loading the content...
Similar Documents
C O ] 1 2 M ay 2 01 9 A construction for clique-free pseudorandom graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bishnoi, Anurag Ihringer, Ferdinand Pepe, Valentina |
| Copyright Year | 2019 |
| 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)), |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://arxiv-export-lb.library.cornell.edu/pdf/1905.04677 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
