2 citations · 2 across the 6 of their papers we have counts for
7 papers
Leaf-to-leaf paths and cycles in degree-critical graphs
Francesco Di Braccio, Kyriakos Katsamaktsis, Jie Ma +2
An -vertex graph is degree 3-critical if it has edges and no proper induced subgraph with minimum degree at least 3. In 1988, Erdős, Faudree, Gyárfás, and Schelp asked…
Leaf-to-leaf paths of many lengths
Francesco Di Braccio, Kyriakos Katsamaktsis, Alexandru Malekshahian
We prove that every tree of maximum degree with leaves contains paths between leaves of at least distinct lengths. This settles in a strong form…
Building graphs with high minimum degree on a budget
Kyriakos Katsamaktsis, Shoham Letzter
We consider the problem of constructing a graph of minimum degree in the following controlled random graph process, introduced recently by Frieze, Krivelevich and Michaeli…
Rainbow subgraphs of uniformly coloured randomly perturbed graphs
Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia
For a given , the randomly perturbed graph model is defined as the union of any -vertex graph with minimum degree and the binomial random graph $\mathbf{G…
Ascending Subgraph Decomposition
Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy +1
A typical theme for many well-known decomposition problems is to show that some obvious necessary conditions for decomposing a graph into copies are also suf…
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia
We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every there exists su…