A construction for clique-free pseudorandom graphs

DOI10.1007/s00493-020-4226-6zbMath1463.05373arXiv1905.04677OpenAlexW3009277196MaRDI QIDQ2216919

Ferdinand Ihringer, Valentina Pepe, Anurag Bishnoi

Publication date: 18 December 2020

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numbersedge densitypseudorandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Association schemes, strongly regular graphs (05E30) Generalized Ramsey theory (05C55) Combinatorial structures in finite projective spaces (51E20) Ramsey theory (05D10)

Related Items (8)

A clique-free pseudorandom subgraph of the pseudo polarity graph ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ A note on pseudorandom Ramsey graphs ⋮ Graphs associated with orthogonal collections of \(k\)-planes over finite fields ⋮ Regular Turán numbers of complete bipartite graphs ⋮ Multicolor Ramsey numbers via pseudorandom graphs ⋮ Recognizing sets of generators in finite polar spaces ⋮ Approximately strongly regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle factors in sparse pseudo-random graphs
• The early evolution of the \(H\)-free process
• Strongly regular graphs
• Explicit Ramsey graphs and orthonormal labelings
• Constructive bounds for a Ramsey-type problem
• Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points
• Interlacing eigenvalues and graphs
• New strongly regular graphs from finite geometries via switching
• Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
• Finite Geometry and Combinatorial Applications
• A Sequence of Triangle-Free Pseudorandom Graphs
• A generalization of Turán's theorem

This page was built for publication: A construction for clique-free pseudorandom graphs