5 citations · 5 across the 5 of their papers we have counts for
5 papers · 1 filter
Large cliques in graphs with forbidden semi-induced structures
Nannan Chen, Yulai Ma, Fan Yang
In 2022, Holmsen showed that any graph with at least \( c \binom{n}{r} \) \(r\)-cliques but no induced complete -partite graph must contain a clique of order \…
Some conjectures on -graphs and equivalences
Yulai Ma, Eckhard Steffen, Isaak H. Wolf +1
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. Seymour [On multicolourings of cubic graphs, and conjecture…
Sets of -graphs that color all -graphs
Yulai Ma, Davide Mattiolo, Eckhard Steffen +1
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. Let and be -graphs. An -coloring of is a…
Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
Yulai Ma, Davide Mattiolo, Eckhard Steffen +1
For let be the maximum number such that every -edge-connected -graph has pairwise disjoint perfect matchings. There are only a few values o…
Pairwise disjoint perfect matchings in -edge-connected -regular graphs
Yulai Ma, Davide Mattiolo, Eckhard Steffen +1
Thomassen [Problem 1 in Factorizing regular graphs, J. Combin. Theory Ser. B, 141 (2020), 343-351] asked whether every -edge-connected -regular graph of even order has …