The isoperimetric number of the incidence graph of PG(n,q)
zbMATH Open1393.05168arXiv1612.03293MaRDI QIDQ1658768FDOQ1658768
Authors: Andrew Elvey Price, Muhammad Adib Surani, Sanming Zhou
Publication date: 15 August 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.03293
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
projective spaceprojective planeisoperimetric numberincidence-free numbervertex-isoperimetric number
Combinatorial aspects of finite geometries (05B25) Connectivity (05C40) General theory of linear incidence geometry and projective geometries (51A05)
Cites Work
- Expander graphs and their applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complete \((k, 3)\)-arcs of \(\mathrm{PG}(2,q), q\leq 13\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Isoperimetric Inequality on the Discrete Torus
- Optimal numberings and isoperimetric problems on graphs
- Expansion properties of Levi graphs.
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Classification of 2-arc-transitive dihedrants
- Some maximal arcs in finite projective planes
- On an isoperimetric problem for Hamming graphs
- Large incidence-free sets in geometries
- On the number of coprime integer pairs within a circle
- Title not available (Why is that?)
- Local Expansion of Symmetrical Graphs
- Title not available (Why is that?)
- Nonincident points and blocks in designs
Cited In (3)
This page was built for publication: The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1658768)