From the 2 of 7 linked papers with an AI index.
7 papers
Quasirandomness and Uniform Twin-Width
George Kontogeorgiou, Bobby Miraftab
For every nontrivial finite group, we prove that its quasirandom degree gives a polynomial lower bound on its uniform twin-width, whereas its minimum faithful complex representatio…
The Volume Helly Theorem in the plane, colorful version
Imre Bárány, Bobby Miraftab, Leonidas Theocharous
We prove a colorful volume Helly theorem for convex sets in : There is a constant such that if are fini…
Automorphism Groups in Extremal Families of Polyhedral Graphs
Riccardo W. Maffucci, Bobby Miraftab
The paper investigates automorphism groups of several extremal families of polyhedral (planar 3‑polytopal) graphs, proving asymmetry for minimal graphs with a full range of vertex…
On Matrix Product Factorization in Association Schemes
Allen W. Herman, Bobby Miraftab
The paper investigates matrix product factorizations within symmetric association schemes, providing structural and spectral criteria, valency and rank restrictions, and classifyin…
Separation profiles of hyperbolic planar and apex-minor-free graphs
Joseph P. MacManus, Bobby Miraftab
We show that the separation profile of a hyperbolic planar graph and, more generally, a hyperbolic apex-minor-free graph, grows at most logarithmically, answering a question of Ben…
Accessibility and Twin-width
George Kontogeorgiou, Bobby Miraftab
We show that finite twin-width does not imply accessibility for finitely generated groups, which answers a question of Esperet. That is, we prove that there exists a finitely gener…