3 papers
math.CO2019
Fractional cocoloring of graphs
John Gimbel, André Kündgen, Michael Molloy
The cochromatic number of a graph is the fewest number of colors needed to color the vertices of so that each color class is a clique or an independent set. In a fra…
math.CO2017
Expected reliability of communication protocols
André Kündgen, Janina Patno
We consider the problem of sending a message from a sender to a receiver through an unreliable network by specifying in a protocol what each vertex is supposed to do if it…
math.CO2012
Finding minors in graphs with a given path structure
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contai…