Mathematics Problem Archive
Showing 1-3 of 3 problems
AMR-029-0075
Solved
Sabidussi's compatibility conjecture
v1.3 research notesLet 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...
L3
AMR-030-0013
Solved
Show that the discrepancy of any hypergraph H is at most c|E(H)|^(1/2)
v1.3 research notesBeck: Show that the discrepancy of any hypergraph H is at most c|E(H)|^(1/2)...
L3
AMR-030-0039
Solved
Is the weak order on S_(n) (the "inversion" poset) Sperner
v1.3 research notesIs the weak order on S_(n) (the "inversion" poset) Sperner?...
L2