
On the Average (Edge)Connectivity of Minimally k(Edge)Connected Graphs
Let G be a graph of order n and let u,v be vertices of G. Let κ_G(u,v) d...
read it

Extremal overlapfree and extremal βfree binary words
An overlapfree (or βfree) word w over a fixed alphabet Σ is extremal i...
read it

The undirected repetition threshold and undirected pattern avoidance
For a rational number r such that 1<r≤ 2, an undirected rpower is a wor...
read it

The Threshold Dimension and Irreducible Graphs
Let G be a graph, and let u, v, and w be vertices of G. If the distance ...
read it

Lengths of extremal squarefree ternary words
A squarefree word w over a fixed alphabet Σ is extremal if every word o...
read it

The Weak Circular Repetition Threshold Over Large Alphabets
The repetition threshold for words on n letters, denoted (n), is the inf...
read it

The Number of Threshold Words on n Letters Grows Exponentially for Every n≥ 27
For every n≥ 27, we show that the number of n/(n1)^+free words (i.e., ...
read it

The undirected repetition threshold
For rational 1<r≤ 2, an undirected rpower is a word of the form xyx', w...
read it
Lucas Mol
is this you? claim profile