R. Kirsch

activity

20162023

most citedUniversal Partial Words over Non-Binary Alphabets

21 citations · 43 across the 10 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017★ 1 cited

Maximizing the density of $K_{t}$ 's in graphs of bounded degree and clique number

R. Kirsch, A. J. Radcliffe

Zykov showed in 1949 that among graphs on $n$ vertices with clique number $ω (G) \leq ω$ , the Turán graph $T_{ω} (n)$ maximizes not only the number of edges but also the number of copie…

math.CO2017★ 1 cited

$k$ -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…

math.CO2017

Many Triangles with Few Edges

R. Kirsch, A. J. Radcliffe

Extremal problems concerning the number of independent sets or complete subgraphs in a graph have been well studied in recent years. Cutler and Radcliffe proved that among graphs w…

Maximizing the density of Kt​'s in graphs of bounded degree and clique number

k-Foldability of Words

Many Triangles with Few Edges

Maximizing the density of $K_{t}$ 's in graphs of bounded degree and clique number

$k$ -Foldability of Words