University of Denver

output

19962026

most citedThe Large Area Telescope on the Fermi Gamma-ray Space Telescope Mission

4.1k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

26 papers · 1 filter

math.CO2023

The zero forcing numbers and propagation times of gear graphs and helm graphs

Sara Anderton, Rilee Burden, McKenzie Fontenot +8

Zero forcing is a dynamic coloring process on graphs. Initially, each vertex of a graph is assigned a color of either blue or white, and then a process begins by which blue vertice…

math.CO2023★ 2 cited

On Rado numbers for equations with unit fractions

Collier Gaiser

Let $f_{r} (k)$ be the smallest positive integer $n$ such that every $r$ -coloring of ${1, 2, ..., n}$ has a monochromatic solution to the nonlinear equation \[1/x_1+\cdots+1/x_k=1/y,\]…

math.CO2023

Moments of Colored Permutation Statistics on Conjugacy Classes

Jesse Campion Loth, Michael Levet, Kevin Liu +2

In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups $S_{n, r} = Z_{r} ≀ S_{n}$ . We first show that…

math.CO2021★ 1 cited

Division sudokus: Invariants, enumeration and multiple partitions

Aleš Drápal, Petr Vojtěchovský

A division sudoku is a latin square whose all six conjugates are sudoku squares. We enumerate division sudokus up to a suitable equivalence, introduce powerful invariants of divisi…

math.CO2020★ 2 cited

Diagonal groups and arcs over groups

R. A. Bailey, Peter J. Cameron, Michael Kinyon +1

In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m \geq 2$ , a set of $m + 1$ partitions of a set $Ω$ , any $m$ of which are the minimal no…

math.CO2020★ 1 cited

An Extremal Problem on Rainbow Spanning Trees in Graphs

Matthew DeVilbiss, Bradley Fain, Amber Holmes +3

A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…

math.CO2020★ 1 cited

Interval parking functions

Emma Colaric, Ryan DeMuse, Jeremy L. Martin +1

Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking…

math.CO2019★ 1 cited

A variant of $IdentityFinder$ and some new identities of Rogers-Ramanujan-MacMahon type

Shashank Kanade, Debajyoti Nandi, Matthew C. Russell

We report on findings of a variant of $IdentityFinder$ - a Maple program that was used by two of the authors to conjecture several new identities of Rogers-Ramanujan kin…

math.CO2018★ 13 cited

The zero forcing polynomial of a graph

Kirk Boyer, Boris Brimkov, Sean English +5

Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to beco…

math.CO2017★ 4 cited

Many edge-disjoint rainbow spanning trees in general graphs

Paul Horn, Lauren M. Nelsen

A rainbow spanning tree in an edge-colored graph is a spanning tree in which each edge is a different color. Carraher, Hartke, and Horn showed that for $n$ and $C$ large enough, if…

math.CO2016★ 8 cited

Maximizing the number of $x$ -colorings of $4$ -chromatic graphs

Aysel Erey

Let $C_{4} (n)$ be the family of all connected $4$ -chromatic graphs of order $n$ . Given an integer $x \geq 4$ , we consider the problem of finding the maximum number of $x$ -co…

math.CO2016★ 4 cited

On the Wiener index, distance cospectrality and transmission regular graphs

Aida Abiad, Boris Brimkov, Aysel Erey +5

In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$ -cospectral if their distance matrices have the…

math.CO2015

Strong spatial mixing in homomorphism spaces

Raimundo Briceño, Ronnie Pavlov

Given a countable graph $G$ and a finite graph $H$ , we consider $Hom (G, H)$ the set of graph homomorphisms from $G$ to $\mat…

math.CO2015★ 3 cited

Overlapping latin subsquares and full products

Joshua M. Browning, Petr Vojtěchovský, Ian M. Wanless

We derive necessary and sufficient conditions for there to exist a latin square of order $n$ containing two subsquares of order $a$ and $b$ that intersect in a subsquare of order $…

math.CO2015

Cycle structure of autotopisms of quasigroups and Latin squares

Douglas S. Stones, Petr Vojtěchovský, Ian M. Wanless

An autotopism of a Latin square is a triple $(α, β, γ)$ of permutations such that the Latin square is mapped to itself by permuting its rows by $α$ , columns by $β$ , and symbols by $γ…

math.CO2015

Colored graphs without colorful cycles

Richard N. Ball, Aleš Pultr, Petr Vojtěchovský

A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a…

math.CO2015★ 1 cited

Color-blind index in graphs of very low degree

Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6

Let $c : E (G) \to [k]$ be an edge-coloring of a graph $G$ , not necessarily proper. For each vertex $v$ , let $c ˉ (v) = (a_{1}, \dots, a_{k})$ , where $a_{i}$ is the number of edges incident…

math.CO2014

Rainbow Ramsey simple structures

Natasha Dobrinen, Claude Laflamme, Norbert Sauer

A relational structure $R$ is {\em rainbow Ramsey} if for every finite induced substructure $C$ of $R$ and every colouring of the copies of $C$ …

math.CO2014★ 1 cited

An upper bound on the extremal version of Hajnal's triangle-free game

Csaba Biró, Paul Horn, D. Jacob Wildstrom

A game starts with the empty graph on $n$ vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a ma…

math.CO2014

Topological Ramsey spaces and metrically Baire sets

Natasha Dobrinen, Jose G. Mijares

We characterize a class of topological Ramsey spaces such that each element $R$ of the class induces a collection ${R_{k}}_{k < ω}$ of projected spaces which have t…

math.CO2014★ 3 cited

The Moufang's theorem for non-Moufang loops

Izabella Stuhl

We introduce a class of non-Moufang loops satisfying the Moufang's theorem.

math.CO2011★ 1 cited

An inverse theorem: when the measure of the sumset is the sum of the measures in a locally compact abelian group

John T. Griesmer

We classify the pairs of subsets (A,B) of a locally compact abelian group satisfying m(A+B)=m(A)+m(B), where m is Haar measure. This generalizes a result of M. Kneser classifying s…

math.CO2011

List Distinguishing Parameters of Trees

Michael Ferrara, Ellen Gethner, Stephen G. Hartke +2

A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D…

math.CO2010

Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture

Kyle Pula

For a finite loop $Q$ , let $P (Q)$ be the set of elements that can be represented as a product containing each element of $Q$ precisely once. Motivated by the recent proof of the H…

The zero forcing numbers and propagation times of gear graphs and helm graphs

On Rado numbers for equations with unit fractions

Moments of Colored Permutation Statistics on Conjugacy Classes

Division sudokus: Invariants, enumeration and multiple partitions

Diagonal groups and arcs over groups

An Extremal Problem on Rainbow Spanning Trees in Graphs

Interval parking functions

A variant of IdentityFinder and some new identities of Rogers-Ramanujan-MacMahon type

The zero forcing polynomial of a graph

Many edge-disjoint rainbow spanning trees in general graphs

Maximizing the number of x-colorings of 4-chromatic graphs

On the Wiener index, distance cospectrality and transmission regular graphs

Strong spatial mixing in homomorphism spaces

Overlapping latin subsquares and full products

Cycle structure of autotopisms of quasigroups and Latin squares

Colored graphs without colorful cycles

Color-blind index in graphs of very low degree

Rainbow Ramsey simple structures

An upper bound on the extremal version of Hajnal's triangle-free game

Topological Ramsey spaces and metrically Baire sets

The Moufang's theorem for non-Moufang loops

An inverse theorem: when the measure of the sumset is the sum of the measures in a locally compact abelian group

List Distinguishing Parameters of Trees

Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture

A variant of $IdentityFinder$ and some new identities of Rogers-Ramanujan-MacMahon type

Maximizing the number of $x$ -colorings of $4$ -chromatic graphs