5 citations · 12 across the 9 of their papers we have counts for
13 papers
Minimum packing density for sets of four integers
Cindy Li, David Offner, Iris Ye
We prove that the set achieves the minimum packing density among all sets of integers with cardinality four, with a density of .
Cycle decompositions of cartesian products of two cycles
Moriah Aberle, Sarah Gold, Rivkah Moshe +1
We say a graph decomposes a graph if there exists a partition of the edges of into subgraphs isomorphic to . We seek to characterize necessary and sufficient conditi…
Generalized Turán densities in the hypercube
Maria Axenovich, Laurin Benz, David Offner +1
A classical extremal, or Turán-type problem asks to determine , the largest number of edges in a subgraph of a graph which does not contain a subgraph isomorphi…
Decompositions of even hypercubes into cycles whose length is a power of two
Samuel Gibson, David Offner
If is even, the -dimensional hypercube can be decomposed into edge-disjoint cycles of length for every value of from to .
Long path and cycle decompositions of even hypercubes
Maria Axenovich, David Offner, Casey Tompkins
We consider edge decompositions of the -dimensional hypercube into isomorphic copies of a given graph . While a number of results are known about decomposing into…
An analysis of a fair division protocol for drawing legislative districts
Jessica De Silva, Brady Gales, Bryson Kagy +1
Landau, Reid, and Yershov [A Fair Division Solution to the Problem of Redistricting, \textit{Social Choice and Welfare}, 2008] propose a protocol for drawing legislative districts…