Y. Pehova

collaborators

4 papers

math.CO2026

Universality for transversal Hamilton cycles

Candida Bowtell, Patrick Morris, Yanitsa Pehova +1

Let $G = {G_{1}, \dots, G_{m}}$ be a graph collection on a common vertex set $V$ of size $n$ such that $I^´ (G_{i}) \geq (1 + o (1)) n /2$ for every $i \in [m]$ . We show that $\mathbf…

math.CO2025

Hamilton decompositions of regular tripartite tournaments

Francesco Di Braccio, Joanna Lada, Viresh Patel +2

KÃ¼hn and Osthus conjectured in 2013 that regular tripartite tournaments are decomposable into Hamilton cycles. Somewhat surprisingly, Granet gave a simple counterexample to this c…

math.CO2025

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case

Pranshu Gupta, Yani Pehova, Emil Powierski +1

The ErdÅs-Rothschild problem from 1974 asks for the maximum number of $s$ -edge colourings in an $n$ -vertex graph which avoid a monochromatic copy of $K_{k}$ , given positive integers…

math.CO2024

Embedding loose spanning trees in 3-uniform hypergraphs

Yanitsa Pehova, Kalina Petrova

In 1995, KomlÃ³s, SÃ¡rkÃ¶zy and SzemerÃ©di showed that every large $n$ -vertex graph with minimum degree at least $(1/2 + I^^{3}) n$ contains all spanning trees of bounded degree. We con…

Universality for transversal Hamilton cycles

Hamilton decompositions of regular tripartite tournaments

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case

Embedding loose spanning trees in 3-uniform hypergraphs

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case