Jonathan A. Noel

activity

20122026

most citedNon-bipartite k-common graphs

8 citations · 61 across the 28 of their papers we have counts for

collaborators

Showing 2023Show all

7 papers · 1 filter

math.CO2023

An Approximate Counting Version of the Multidimensional Szemerédi Theorem

Natalie Behague, Joseph Hyde, Natasha Morrison +2

For any fixed $d \geq 1$ and subset $X$ of $N^{d}$ , let $r_{X} (n)$ be the maximum cardinality of a subset $A$ of ${1, \dots, n}^{d}$ which does not contain a subset of the form $\…

math.CO2023

Turán Colourings in Off-Diagonal Ramsey Multiplicity

Joseph Hyde, Jae-baek Lee, Jonathan A. Noel

The \emph{Ramsey multiplicity constant} of a graph $H$ is the limit as $n$ tends to infinity of the minimum density of monochromatic labeled copies of $H$ in a $2$ -edge colouring o…

math.CO2023

Off-Diagonal Commonality of Graphs via Entropy

Natalie Behague, Natasha Morrison, Jonathan A. Noel

A graph $H$ is common if the limit as $n \to \infty$ of the minimum density of monochromatic labelled copies of $H$ in an edge colouring of $K_{n}$ with red and blue is attained by a s…

math.CO2023

Off-Diagonal Ramsey Multiplicity

Elena Moss, Jonathan A. Noel

The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_{n}$ . We introduce…

math.CO2023

Sidorenko-Type Inequalities for Pairs of Trees

Natalie Behague, Gabriel Crudele, Jonathan A. Noel +1

Given two non-empty graphs $H$ and $T$ , write $H ≽ T$ to mean that $t (H, G)^{∣ E (T) ∣} \geq t (T, G)^{∣ E (H) ∣}$ for every graph $G$ , where $t (\cdot, \cdot)$ is the homomorphism d…

math.CO2023

Disconnected Common Graphs via Supersaturation

Jae-baek Lee, Jonathan A. Noel

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$ -colouring of the edges of a large complete graph is asymptotically minimized by a ra…