On 07.01.2015 at 12:20 in S10, there is the following noon lecture:
3-uniform hypergraphs with no linear cycles
We explore properties of 3-uniform hypergraphs H without linear cycles. We show that they are at most 3-chromatic, have at least two vertices of strong degree at most two and have independent sets of size at least 2|V(H)|/5.
The talk is based on joint work with A. Gyarfas, and M. Simonovits.
Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010