A Sequence of Triangle-Free Pseudorandom Graphs

DOI10.1017/S0963548316000298zbMath1371.05259arXiv1602.03773MaRDI QIDQ5366941

David Conlon

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.03773

zbMATH Keywords

highly pseudorandom triangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of finite geometries (05B25)

Related Items (8)

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)\) ⋮ A construction for clique-free pseudorandom graphs ⋮ Lovász, Vectors, Graphs and Codes ⋮ Triangle‐factors in pseudorandom graphs

Cites Work

• Hanson-Wright inequality and sub-Gaussian concentration
• The triangle-free process
• Polarities and \(2k\)-cycle-free graphs
• Explicit Ramsey graphs and orthonormal labelings
• Approximating the independence number via the \(\vartheta\)-function
• Extremal results in sparse pseudorandom graphs
• Cutting a graph into two dissimilar halves
• A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
• Imbalances in k‐colorations
• Unnamed Item

This page was built for publication: A Sequence of Triangle-Free Pseudorandom Graphs