A sequence of triangle-free pseudorandom graphs
From MaRDI portal
(Redirected from Publication:5366941)
Abstract: A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one might expect from comparison with random graphs. We give an alternative construction for such graphs.
Recommendations
Cites work
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- Approximating the independence number via the -function
- Cutting a graph into two dissimilar halves
- Explicit Ramsey graphs and orthonormal labelings
- Extremal results in sparse pseudorandom graphs
- Hanson-Wright inequality and sub-Gaussian concentration
- Imbalances in k‐colorations
- Polarities and \(2k\)-cycle-free graphs
- Pseudo-random graphs
- The triangle-free process
Cited in
(11)- A clique-free pseudorandom subgraph of the pseudo polarity graph
- A construction for clique-free pseudorandom graphs
- Random cyclic triangle-free graphs of prime order
- Lovász, vectors, graphs and codes
- Triangle‐factors in pseudorandom graphs
- On the extremal number of subdivisions
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
- A note on pseudorandom Ramsey graphs
- The asymptotics of r(4,t)
- Clique factors in pseudorandom graphs
This page was built for publication: A sequence of triangle-free pseudorandom graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366941)
