Danni Peng

activity

20242026

collaborators

4 papers

math.CO2026

Ramsey properties for tilings in random graphs

Lucas AragÃ£o, Xinbu Cheng, Rafael Filipe +3

Let $m H$ be the graph formed by $m$ vertex-disjoint copies of a graph $H$ . Let $G \to (H)_{r}$ denote that, in any $r$ -colouring of the edges of $G$ , there exists a monochromatic cop…

math.CO2026

Separating path systems for cubic graphs and for complete bipartite graphs

Cristina Fernandes, Carlos Hoppen, George Kontogeorgiou +2

A strongly separating path system in a graph $G$ is a collection $P$ of paths in $G$ such that, for every two edges $e$ and $f$ of $G$ , there is a paths in $P$ …

math.CO2025

TurÃ¡n Number of Subdivisions of Multipartite Graphs

Xiao-Chuan Liu, Danni Peng, Xu Yang

In this paper, we investigate the TurÃ¡n exponent for $1$ -subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the TurÃ¡n nu…

math.CO2024

Near rainbow Hamilton cycles in dense graphs

Danni Peng, Zhifei Yan

Finding near-rainbow Hamilton cycles in properly edge-coloured graphs was first studied by Andersen, who proved in 1989 that every proper edge colouring of the complete graph on $n…