Willem Fletcher

most citedImproved Upper Bound on the Linear Turán Number of the Crown

2 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021★ 2 cited

Improved Upper Bound on the Linear Turán Number of the Crown

Willem Fletcher

A linear $3$ -graph is a set of vertices along with a set of edges, which are three element subsets of the vertices, such that any two edges intersect in at most one vertex. The cro…

math.CO2021★ 2 cited

Crowns in linear $3$ -graphs

Alvaro Carbonero, Willem Fletcher, Jing Guo +3

A \textit{linear $3$ -graph}, $H = (V, E)$ , is a set, $V$ , of vertices together with a set, $E$ , of $3$ -element subsets of $V$ , called edges, so that any two distinct edges intersec…

math.CO2021

Graphs with Many Hamiltonian Paths

Erik Carlson, Willem Fletcher, MurphyKate Montee +3

A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We constr…

Improved Upper Bound on the Linear Turán Number of the Crown

Crowns in linear 3-graphs

Graphs with Many Hamiltonian Paths

Crowns in linear $3$ -graphs