39 citations · 111 across the 33 of their papers we have counts for
8 papers · 1 filter
Independent Chains in Acyclic Posets
Nika Salia, Christoph Spiegel, Casey Tompkins +1
We consider the problem of determining the maximum order of an induced vertex-disjoint union of cliques in a graph. More specifically, given some family of graphs of…
Set systems related to a house allocation problem
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +4
We are given a set of buyers, a set of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping from $A…
The Maximum Number of Paths of Length Three in a Planar Graph
Andrzej Grzesik, Ervin Győri, Addisu Paulos +3
Let denote the maximum number of copies of possible in an -vertex planar graph. The function has been determined when is a cycle of length or b…
The Maximum Number of Pentagons in a Planar Graph
Ervin Győri, Addisu Paulos, Nika Salia +2
In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an -vertex planar graph. They precisely determined the maximum numb…
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…
On forbidden poset problems in the linear lattice
Jimeng Xiao, Casey Tompkins
In this note, we determine the maximum size of a -free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as…