The independence number for polarity graphs of even order planes
From MaRDI portal
Publication:356737
DOI10.1007/S10801-012-0392-YzbMATH Open1269.05088OpenAlexW2003877774MaRDI QIDQ356737FDOQ356737
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Eigenvalue bounds for independent sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Invariant Semidefinite Programs
- Coherent algebras
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- Bounds on subsets of coherent configurations
- 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
- 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
Cited In (6)
- A relative bound for independence
- Tightness in subset bounds for coherent configurations
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- Independent sets in polarity graphs
- The independence number of the orthogonality graph in dimension \(2^k\)
- On the independence number of graphs related to a polarity
This page was built for publication: The independence number for polarity graphs of even order planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356737)
