21 citations · 22 across the 10 of their papers we have counts for
11 papers
Note on vertex disjoint rainbow triangles in edge-colored graphs
Jürgen Kritschgau, tahda queer, Cyrus Young +1
Given an edge-colored graph , we denote the number of colors as , and the number of edges as . An edge-colored graph is rainbow if no two edges share the same color.…
Community Detection in Hypergraphs via Mutual Information Maximization
Jurgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez +7
The hypergraph community detection problem seeks to identify groups of related nodes in hypergraph data. We propose an information-theoretic hypergraph community detection algorith…
The -forcing number for some graph families
Jorge Blanco, Stephanie Einstein, Caleb Hostetler +2
The zero forcing number was introduced as a combinatorial bound on the maximum nullity taken over the set of real symmetric matrices that respect the pattern of an underlying graph…
Complementary Vanishing Graphs
Craig Erickson, Luyining Gan, Jürgen Kritschgau +2
Given a graph with vertices , we define to be the set of symmetric matrices such that for we have if…
Generalizing forbidden induced subgraph characterizations of high throttling numbers
Jurgen Kritschgau, Josh Carlson
Zero forcing is a process that models the spread of information throughout a graph as white vertices are forced to turn blue using a color change rule. The idea of throttling, intr…
Cutoff in the Bernoulli-Laplace model with swaps
Joseph S. Alameda, Caroline Bang, Zachary Brennan +3
This paper considers the -Bernoulli--Laplace model in the case when there are two urns, the total number of red and white balls is the same, and the number of selections …
Rainbow Solutions to the Sidon Equation in Cyclic Groups
Zhanar Berikkyzy, Jürgen Kritschgau
Given a coloring of group elements, a rainbow solution to an equation is a solution whose every element is assigned a different color. The rainbow number of for an e…
On leaky forcing and resilience
Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg +1
A leak is a vertex that is not allowed to perform a force during the zero forcing process. Leaky forcing was recently introduced as a new variation of zero forcing in order to anal…
Rainbow matchings of size in graphs with total color degree at least
J\''{u}rgen Kritschgau
The existence of a rainbow matching given a minimum color degree, proper coloring, or triangle-free host graph has been studied extensively. This paper, generalizes these problems…
Rainbow numbers for in
Erin Bevilacqua, Samuel King, Jürgen Kritschgau +3
In this work, we investigate the fewest number of colors needed to guarantee a rainbow solution to the equation in . This value is called the Rain…
Throttling positive semidefinite zero forcing propagation time on graphs
Joshua Carlson, Leslie Hogben, Jürgen Kritschgau +4
Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size…