5 citations · 10 across the 7 of their papers we have counts for
7 papers
Algebraic Properties of a Hypergraph Lifting Map
Mark Budden, Josh Hiller, Tommy Meek +1
Recent work in hypergraph Ramsey theory has involved the introduction of a "lifting map" that associates a certain -uniform hypergraph to a given graph, bounding cliques in a pr…
Avoiding monochromatic sub-paths in uniform hypergraph paths and cycles
W. Zane Billings, Justin Clifton, Josh Hiller +6
We present a recursive formula for the number of ways to color vertices blue in an r-uniform hyperpath of size while avoiding a blue monochromatic sub-hyperpath of length k…
Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
Mark Budden, Joshua Hiller, Andrew Penland
Much recent progress in hypergraph Ramsey theory has focused on constructions that lead to lower bounds for the corresponding Ramsey numbers. In this paper, we consider application…
Minimally Connected Hypergraphs
Mark Budden, Josh Hiller, Andrew Penland
Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and mor…
On Covers of Dihedral 2-Groups by Powerful Subgroups
Risto Atanasov, Adam Gregory, Luke Guatelli +1
A finite -group is called \textit{powerful} if either is odd and or and . A {\em{cover}} for a group is a collection of su…
Trees and -Good Hypergraphs
Mark Budden, Andrew Penland
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of -good graphs. In this article, we consider the general…