Independent Sets in Polarity Graphs

DOI10.1137/16M1057656zbMath1350.05127arXiv1601.05058MaRDI QIDQ2832577

Michael Tait, Craig Timmons

Publication date: 11 November 2016

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

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

zbMATH Keywords

independent setspolaritiespolarity graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On sensitivity in bipartite Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The independence number for polarity graphs of even order planes
• Turán numbers of bipartite graphs plus an odd cycle
• Planar functions and planes of Lenz-Barlotti class II
• Some constructive bounds on Ramsey numbers
• Graphs from projective planes
• On hypergraphs of girth five
• Coloring graphs with sparse neighborhoods
• Nonincident points and blocks in designs
• Large incidence-free sets in geometries
• On the chromatic number of the Erdős-Rényi orthogonal polarity graph
• Sharp bounds for some multicolour Ramsey numbers
• Planes of order \(n\) with collineation groups of order \(n^ 2\)
• Cops and Robbers on Graphs Based on Designs
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Polarity graphs revisited
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Independent Sets in Polarity Graphs