A clique-free pseudorandom subgraph of the pseudo polarity graph

DOI10.1016/j.disc.2022.112871zbMath1489.05127arXiv2105.03755OpenAlexW3163234650MaRDI QIDQ2138963

Francesco Pavese, Sam Mattheus

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberpseudorandom graphpolarity graphclique-free

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting trees in graphs
• Explicit Ramsey graphs and orthonormal labelings
• Constructive bounds for a Ramsey-type problem
• Interlacing eigenvalues and graphs
• A construction for clique-free pseudorandom graphs
• Multicolor Ramsey numbers via pseudorandom graphs
• On the independence number of graphs related to a polarity
• Finite Geometry and Combinatorial Applications
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph

This page was built for publication: A clique-free pseudorandom subgraph of the pseudo polarity graph