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 2014Show all

3 papers · 1 filter

math.CO2014★ 1 cited

Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings

Richard C. Brewster, Jonathan A. Noel

This work brings together ideas of mixing graph colourings, discrete homotopy, and precolouring extension. A particular focus is circular colourings. We prove that all the $(k, q)$ -…

math.CO2014★ 7 cited

Saturation in the Hypercube and Bootstrap Percolation

Natasha Morrison, Jonathan A. Noel, Alex Scott

Let $Q_{d}$ denote the hypercube of dimension $d$ . Given $d \geq m$ , a spanning subgraph $G$ of $Q_{d}$ is said to be $(Q_{d}, Q_{m})$ -saturated if it does not contain $Q_{m}$ as a subgraph bu…

math.CO2014

On Saturated $k$ -Sperner Systems

Natasha Morrison, Jonathan A. Noel, Alex Scott

Given a set $X$ , a collection $F \subseteq P (X)$ is said to be $k$ -Sperner if it does not contain a chain of length $k + 1$ under set inclusion and it is saturated…

Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings

Saturation in the Hypercube and Bootstrap Percolation

On Saturated k-Sperner Systems

On Saturated $k$ -Sperner Systems