Jonathan A. Noel

Orcid: 0000-0002-8281-8249

According to our database1, Jonathan A. Noel authored at least 31 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three.
SIAM J. Discret. Math., September, 2023

Off-Diagonal Ramsey Multiplicity.
CoRR, 2023

Sidorenko-Type Inequalities for Pairs of Trees.
CoRR, 2023

Six Permutation Patterns Force Quasirandomness.
CoRR, 2023

On the Running Time of Hypergraph Bootstrap Percolation.
Electron. J. Comb., 2023

2022
Common Pairs of Graphs.
CoRR, 2022

Density Maximizers of Layered Permutations.
Electron. J. Comb., 2022

Non-Bipartite K-Common Graphs.
Comb., 2022

2021
Corrigendum to "Reconfiguring graph homomorphisms on the sphere" [European J. Combin. 86 (2020) 103086].
Eur. J. Comb., 2021

Bounding the number of cycles in a graph in terms of its degree sequence.
Eur. J. Comb., 2021

Cyclic coloring of plane graphs with maximum face size 16 and 17.
Eur. J. Comb., 2021

Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2020
Characterization of quasirandom permutations by a pattern sum.
Random Struct. Algorithms, 2020

Graph homomorphism reconfiguration and frozen H-colorings.
J. Graph Theory, 2020

Cycles of length three and four in tournaments.
J. Comb. Theory, Ser. A, 2020

Reconfiguring graph homomorphisms on the sphere.
Eur. J. Comb., 2020

2018
Supersaturation in posets and applications involving the container method.
J. Comb. Theory, Ser. A, 2018

2017
Extremal Bounds for Bootstrap Percolation in the Hypercube.
Electron. Notes Discret. Math., 2017

Saturation in the Hypercube and Bootstrap Percolation.
Comb. Probab. Comput., 2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings.
CoRR, 2017

2016
A dichotomy theorem for circular colouring reconfiguration.
Theor. Comput. Sci., 2016

2015
A Proof of a Conjecture of Ohba.
J. Graph Theory, 2015

Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings.
J. Graph Theory, 2015

Weak regularity and finitely forcible graph limits.
Electron. Notes Discret. Math., 2015

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.
Eur. J. Comb., 2015

2014
Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings.
CoRR, 2014

On Saturated k-Sperner Systems.
Electron. J. Comb., 2014

2013
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.
Electron. Notes Discret. Math., 2013

Beyond Ohba's Conjecture: A bound on the choice number of <i>k</i>-chromatic graphs with <i>n</i> vertices.
CoRR, 2013

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.
CoRR, 2013

2012
Extending precolourings of circular cliques.
Discret. Math., 2012


  Loading...