4 papers · 1 filter
Towards Graham's rearrangement conjecture via rainbow paths
Matija BuciÄ, Bryce Frederickson, Alp Müyesser +2
We study an old question in combinatorial group theory which can be traced back to a conjecture of Graham from 1971. Given a group , and some subset , is it poss…
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
Steffen Borgwardt, ZdenÄk DvoÅák, Bryce Frederickson +2
The assignments of a set of items into clusters of prescribed sizes can be encoded as the vertices of the partition polytope . W…
Treewidth, Hadwiger Number, and Induced Minors
Rutger Campbell, James Davies, Marc Distel +7
Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence o…
Regular bipartite decompositions of pseudorandom graphs
Asaf Ferber, Bryce Frederickson, Dingjia Mao +2
In 1972, Kotzig proved that for every even , the complete graph can be decomposed into edge-disjoint regular bipartite spanning subgraphs, which is b…