1 citations · 3 across the 6 of their papers we have counts for
7 papers
Nowhere-zero -flows in Cayley graphs on solvable groups of twice square-free order
Milad Ahanjideh, István Kovács
We verify Tutte's -flow conjecture in the class of Cayley graphs on solvable groups of order , where is square-free. The proof relies on a new necessary and sufficient c…
On balanceable and simply balanceable regular graphs
Milad Ahanjideh, Martin Milanič, Mary Servatius
We continue the study of balanceable graphs, defined by Caro, Hansberg, and Montejano in 2021 as graphs such that any -coloring of the edges of a sufficiently large complete…
Stability of Rose Window graphs
Milad Ahanjideh, István Kovács, Klavdija Kutnar
A graph is said to be stable if for the direct product , is isomorphic to ; otherwise,…
Maximum size of a triangle-free graph with bounded maximum degree and matching number
Milad Ahanjideh, Tınaz Ekim, Mehmet Akif Yıldız
Determining the maximum number of edges under degree and matching number constraints have been solved for general graphs by Chvátal and Hanson (1976), and by Balachandran and Khare…
On the Largest intersecting set in and some of its subgroups
Milad Ahanjideh
Let be a power of a prime number and be the -dimensional column vector space over a finite field . Assume that . In this paper we…
Hoffmann-Ostenhof's conjecture for claw-free cubic graphs
Milad Ahanjideh, Elham Aboomahigir
Hoffmann-Ostenhof's Conjecture states that states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a -regular subgraph. In…
Decomposing Claw-free Subcubic Graphs and -Chordal Subcubic Graphs
Elham Aboomahigir, Milad Ahanjideh, Saieed Akbari
Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a -regular subgraph. In this paper,…