The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)

zbMath1393.05168arXiv1612.03293MaRDI QIDQ1658768

Sanming Zhou, Muhammad Adib Surani, Andrew Elvey Price

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

zbMATH Keywords

projective spaceprojective planeisoperimetric numberincidence-free numbervertex-isoperimetric number

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) General theory of linear incidence geometry and projective geometries (51A05) Connectivity (05C40)

Related Items (2)

The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals ⋮ Incidence‐free sets and edge domination in incidence graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of 2-arc-transitive dihedrants
• On an isoperimetric problem for Hamming graphs
• Nonincident points and blocks in designs
• Large incidence-free sets in geometries
• The complete (k, 3)-arcs of PG(2,q), q≤13
• Expander graphs and their applications
• Local Expansion of Symmetrical Graphs
• On the number of coprime integer pairs within a circle
• An Isoperimetric Inequality on the Discrete Torus
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Optimal numberings and isoperimetric problems on graphs
• Some maximal arcs in finite projective planes

This page was built for publication: The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)