Krystal Guo

activity

20102026

most citedPerfect state transfer on distance-regular graphs and association schemes

72 citations · 112 across the 21 of their papers we have counts for

collaborators

Showing 2018Show all

5 papers · 1 filter

math.CO2018

The biclique covering number of grids

Krystal Guo, Tony Huynh, Marco Macchia

We determine the exact value of the biclique covering number for all grid graphs.

math.CO2018★ 4 cited

The chromatic index of strongly regular graphs

Sebastian M. Cioaba, Krystal Guo, Willem H. Haemers

We determine (partly by computer search) the chromatic index (edge-chromatic number) of many strongly regular graphs (SRGs), including the SRGs of degree $k \leq 18$ and their comp…

math.CO2018

Short rainbow cycles in graphs and matroids

Matt DeVos, Matthew Drescher, Daryl Funk +5

Let $G$ be a simple $n$ -vertex graph and $c$ be a colouring of $E (G)$ with $n$ colours, where each colour class has size at least $2$ . We prove that $(G, c)$ contains a rainbow cycl…

math.CO2018★ 1 cited

Partially ordering the class of invertible trees

Krystal Guo

A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1,…

math.CO2018

Using the existence of t-designs to prove Erdős-Ko-Rado

Chris Godsil, Krystal Guo

In 1984, Wilson proved the Erdős-Ko-Rado theorem for $t$ -intersecting families of $k$ -subsets of an $n$ -set: he showed that if $n \geq (t + 1) (k - t + 1)$ and $F$ is a family of $…