A. Czygrinow

collaborators

3 papers

math.CO2026

Rainbow cycles in triangle-free graphs

Andrzej Czygrinow, Skand Parvatikar

Let $G = (V, E)$ be an edge-colored graph, and let $I^´^{c} (G) = min_{v \in V} {d^{c} (v)}$ where $d^{c} (v)$ is the number of colors on edges incident to a vertex $v$ . We show that f…

math.CO2024

Tight minimum colored degree condition for rainbow connectivity

Andrzej Czygrinow, Xiaofan Yuan

Let $G = (V, E)$ be a graph on $n$ vertices, and let $c : E \to P$ , where $P$ is a set of colors. Let $I^´^{c} (G) = min_{v \in V} {d^{c} (v)}$ where $d^{c} (v)$ is the number of color…

math.CO2024

Rainbow Cliques in Edge-Colored Graphs

Andrzej Czygrinow, Theodore Molla, Brendan Nagle

Let $G = (V, E)$ be an $n$ -vertex graph and let $c : E \to N$ be a coloring of its edges. Let $d^{c} (v)$ be the number of distinct colors on the edges at $v \in V$ and let $Î´…