Mathematics Problem Archive

Let G=(V,E) be an Eulerian graph with minimum degree at least 4, and let W be a closed Eulerian walk of G. Is it true that G has a cycle decomposition...

Beck: Show that the discrepancy of any hypergraph H is at most c|E(H)|^(1/2)...