The independence number for polarity graphs of even order planes
From MaRDI portal
Publication:356737
DOI10.1007/s10801-012-0392-yzbMath1269.05088MaRDI QIDQ356737
Sylvia A. Hobart, Jason S. Williford
Publication date: 26 July 2013
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-012-0392-y
independence number; projective plane; coherent configuration; even order planes; orthogonal polarity graph
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
A relative bound for independence, On the chromatic number of the Erdős-Rényi orthogonal polarity graph, Tightness in subset bounds for coherent configurations, Independent Sets in Polarity Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalue bounds for independent sets
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- Bounds on subsets of coherent configurations
- Coherent algebras
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- On the number of edges of quadrilateral-free graphs
- Relaxations of Combinatorial Problems Via Association Schemes
- Invariant Semidefinite Programs
- Self-Dual Configurations and Their Levi Graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Polarities in finite projective planes
- Geodetic graphs of diameter two
