activity
20132026
most citedTriangulations of simplices with vanishing local h-polynomial

30 citations · 64 across the 36 of their papers we have counts for

collaborators
Showing 2024Show all

8 papers · 1 filter

math.CO2024

The basis number of 1-planar graphs

Saman Bazargani, Therese Biedl, Prosenjit Bose +2

Let be a set of Eulerian subgraphs of a graph . We say forms a -basis if it is a minimum set that generates the cycle space of , and any edge of lies in at mos…

math.CO2024

Hamiltonicity of Transitive Graphs Whose Automorphism Group Has as Commutator Subgroups

Florian Lehner, Farzad Maghsoudi, Babak Miraftab

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this…

math.CO2024

On the -independence number in 1-planar graphs

Therese Biedl, Prosenjit Bose, Babak Miraftab

The -independence number of a graph is the largest possible size of an independent set in where each vertex of has degree at least in . Upper bounds for t…

math.CO2024★ 1 cited

Basis number of bounded genus graphs

Florian Lehner, Babak Miraftab

The basis number of a graph is the smallest integer such that admits a basis for its cycle space, where each edge of belongs to at most members of . In t…

math.CO2024

Sparse graphs with local covering conditions on edges

Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari +1

In 1988, Erdős suggested the question of minimizing the number of edges in a connected -vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman…

math.CO2024

Spectral Methods for Matrix Product Factorization

Saieed Akbari, Yi-Zheng Fan, Fu-Tao Hu +2

A graph is factored into graphs and via a matrix product if there exist adjacency matrices , , and of , , and , respectively, such that . In…

math.CO2024

Graphs of bounded chordality

Aristotelis Chaniotis, Babak Miraftab, Sophie Spirkl

A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the…

math.GR2024

Subgroups arising from connected components in the Morse boundary

Annette Karrer, Babak Miraftab, Stefanie Zbinden

We study connected components of the Morse boundary and their stabilisers. We introduce the notion of point-convergence and show that if the set of non-singleton connected componen…