Turán problems in pseudorandom graphs
From MaRDI portal
Cites work
- A clique-free pseudorandom subgraph of the pseudo polarity graph
- A construction for clique-free pseudorandom graphs
- A note on pseudorandom Ramsey graphs
- Approximating the independence number via the -function
- Constructive bounds for a Ramsey-type problem
- Cross Product Identities in Arbitrary Dimension
- Cycles of even length in graphs
- Discrepancy in graphs and hypergraphs
- Erdös distance problem in vector spaces over finite fields
- Explicit Ramsey graphs and orthonormal labelings
- Extremal results in sparse pseudorandom graphs
- Finite Euclidean graphs and Ramanujan graphs
- Graphs from projective planes
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 3505014 (Why is no real title available?)
- scientific article; zbMATH DE number 3227205 (Why is no real title available?)
- Imbalances in k‐colorations
- Lifts, discrepancy and nearly optimal spectral gap
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a problem of K. Zarankiewicz
- On Graphs that do not Contain a Thomsen Graph
- On the spectrum of projective norm-graphs
- Orthogonal polarity graphs and Sidon sets
- Polarities and \(2k\)-cycle-free graphs
- Pseudo-random graphs
- Random graphs.
- Spectra of Cayley graphs
- Spectra of graphs with transitive groups
- The asymptotics of r(4,t)
- Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
- Turán numbers of bipartite graphs plus an odd cycle
- Turán's theorem for pseudo-random graphs
- Vector cross products
This page was built for publication: Turán problems in pseudorandom graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883604)
