12 citations · 13 across the 4 of their papers we have counts for
7 papers · 1 filter
On Edge-Colored Saturation Problems
Michael Ferrara, Daniel Johnston, Sarah Loeb +6
Let be a family of edge-colored graphs. A -edge colored graph is -saturated if does not contain any graph in but the additi…
-Foldability of Words
Beth Bjorkman, Garner Cochran, Wei Gao +6
We extend results regarding a combinatorial model introduced by Black, Drellich, and Tymoczko (2017+) which generalizes the folding of the RNA molecule in biology. Consider a word…
Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension
Fidel Barrera-Cruz, Thomas Prag, Heather Smith +2
The original notion of dimension for posets is due to Dushnik and Miller and has been studied extensively in the literature. Quite recently, there has been considerable interest in…
Analogies between the crossing number and the tangle crossing number
Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz +8
Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of…
The Graph of Critical Pairs of a Crown
Fidel Barrera-Cruz, Rebecca Garcia, Pamela Harris +5
There is a natural way to associate with a poset a hypergraph , called the hypergraph of critical pairs, so that the dimension of is exactly equal to the chromatic numbe…
Separating Tree-chromatic number from Path-chromatic Number
Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros +4
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~ while the path-chromatic number is unbounded. This resolves a…