Connor Mattes

activity

20162024

most cited

C_{5}

is almost a fractalizer

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

collaborators

4 papers

math.CO2024

The Hypergraph Turán Densities of Tight Cycles Minus an Edge

Bernard Lidicky, Connor Mattes, Florian Pfender

A tight $ℓ$ -cycle minus an edge $C_{ℓ}^{-}$ is the $3$ -graph on the vertex set $[ℓ]$ , where any three consecutive vertices in the string $123 \dots ℓ 1$ form an edge. We sho…

math.CO2021

Low Diameter Monochromatic Covers of Complete Multipartite Graphs

Sean English, Connor Mattes, Grace McCourt +1

Let the diameter cover number, $D_{r}^{t} (G)$ , denote the least integer $d$ such that under any $r$ -coloring of the edges of the graph $G$ , there exists a collection of $t$ monochromat…

math.CO2021★ 4 cited

$C_{5}$ is almost a fractalizer

Bernard Lidický, Connor Mattes, Florian Pfender

We determine the maximum number of induced copies of a 5-cycle in a graph on $n$ vertices for every $n$ . Every extremal construction is a balanced iterated blow-up of the 5-cycle w…

math.CO2016

Triangular Ramsey Numbers

Timothy Trujillo, Connor Mattes, Zachary Chaney +1

The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mi…

The Hypergraph Turán Densities of Tight Cycles Minus an Edge

Low Diameter Monochromatic Covers of Complete Multipartite Graphs

C5​ is almost a fractalizer

Triangular Ramsey Numbers

$C_{5}$ is almost a fractalizer