The isoperimetric number of the incidence graph of PG(n,q)
From MaRDI portal
Publication:1658768
Recommendations
Cites work
- scientific article; zbMATH DE number 18980 (Why is no real title available?)
- scientific article; zbMATH DE number 3521984 (Why is no real title available?)
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 841633 (Why is no real title available?)
- scientific article; zbMATH DE number 3074559 (Why is no real title available?)
- An Isoperimetric Inequality on the Discrete Torus
- Classification of 2-arc-transitive dihedrants
- Expander graphs and their applications
- Expansion properties of Levi graphs.
- Large incidence-free sets in geometries
- Local Expansion of Symmetrical Graphs
- Nonincident points and blocks in designs
- On an isoperimetric problem for Hamming graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- On the number of coprime integer pairs within a circle
- Optimal numberings and isoperimetric problems on graphs
- Some maximal arcs in finite projective planes
- The complete \((k, 3)\)-arcs of \(\mathrm{PG}(2,q), q\leq 13\)
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)