Fredy Yip

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Short monochromatic odd cycles

Oliver Janzer, Fredy Yip

It is easy to see that every $k$ -edge-colouring of the complete graph on $2^{k} + 1$ vertices contains a monochromatic odd cycle. In 1973, Erdős and Graham asked to estimate the smalle…

math.CO2024

The probability that a random graph is even-decomposable

Oliver Janzer, Fredy Yip

A graph $G$ with an even number of edges is called even-decomposable if there is a sequence $V (G) = V_{0} \supset V_{1} \supset \dots \supset V_{k} = \emptyset$ such that for each $i$ , $G[V_i]…

math.CO2024

A variant of the Erdős-Gyárfás problem for $K_{8}$

Fredy Yip

Recently, Alon initiated the study of graph codes and their linear variants in analogy to the study of error correcting codes in theoretical computer science. Alon related the maxi…

Short monochromatic odd cycles

The probability that a random graph is even-decomposable

A variant of the Erdős-Gyárfás problem for K8​

A variant of the Erdős-Gyárfás problem for $K_{8}$