30 citations · 64 across the 36 of their papers we have counts for
16 papers · 1 filter
Hyperfiniteness of boundary actions via tree decompositions
Chris Karpinski, Bobby Miraftab
We study conditions for a countable group acting on a connected locally finite hyperbolic graph to induce a hyperfinite orbit equivalence relation on the Gromov boundary of the gra…
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…
On the Spanning Ratio of the Greedy Triangulation for Convex Point Sets
Prosenjit Bose, Jean Lou de Carufel, Anil Maheshwari +3
The greedy triangulation of a finite planar point set is obtained by considering all segments in nondecreasing order of length and inserting each segment that does not cross an ear…
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…
On -Matrix Product Factorization of graphs
Farzad Maghsoudi, Bobby Miraftab, Sho Suda
We introduce an approximate version of matrix product factorization for graphs. A simple graph on vertices is said to admit an -matrix product factorization if…
Automorphism Groups in Extremal Families of Polyhedral Graphs
Riccardo W. Maffucci, Bobby Miraftab
We study automorphism groups in five extremal families of polyhedral graphs. For every , we prove that every minimum-order -polytopal graph containing a vertex of each d…
On Matrix Product Factorization in Association Schemes
Allen W. Herman, Bobby Miraftab
We study matrix product factorizations (MPFs) in symmetric association schemes: identities where are loopless unions of basic relations and the ordinary…
Cayley Graphs Of Order Are Hamiltonian
Florian Lehner, Farzad Maghsoudi, Bobby Miraftab
Assume is a finite group with order , where , , , and are distinct prime numbers. We prove that every connected Cayley graph of conta…
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…
3-packings in Triangulations: Algorithms, bounds, and Complexity
Prosenjit Bose, Anil Maheshwari, Bobby Miraftab +1
We study -packings in plane triangulations for the three-vertex graphs . For a graph , let denote the maximum size of an -packing in…
Vertex cuts and median decompositions
Joseph P. MacManus, Bobby Miraftab
Median decompositions were introduced by Stavropoulos in 2015 as a generalisation of tree decompositions. In this paper, we further develop and exposit this theory as a tool in str…
On the Spectra of Digraph Laplacians
Saieed Akbari, Michael Cavers, Farzad Maghsoudi +1
We present several Laplacian-type matrices associated with a loopless digraph : the out-/in-degree Laplacians , the incidence…
Spectra of Subdivision Products of Digraphs
Michael Cavers, Farzad Maghsoudi, Babak Miraftab
This paper introduces four types of subdivision products for simple directed graphs extending those from the undirected case, in particular, the subdivision-vertex join, subdivisio…
2-dimensional unit vector flows
Hussein Houdrouge, Bobby Miraftab, Pat Morin
We study -dimensional unit vector flows on graphs, that is, nowhere-zero flows that assign to each oriented edge a unit vector in . We give a new geometric charac…
Basis Number and Pathwidth
Babak Miraftab, Pat Morin, Yelena Yuditsky
We prove two results relating the basis number of a graph to path decompositions of . Our first result shows that the basis number of a graph is at most four times its pathw…