Jonathan A. Noel

From MaRDI portal
(Redirected from Jonathan A. Noel)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tur\'an Colourings in Off-Diagonal Ramsey Multiplicity
(available as arXiv preprint)
N/APaper
On alternating 6-cycles in edge-coloured graphs
The Electronic Journal of Combinatorics
2026-09-16Paper
Forcing quasirandomness in a regular tournament
Innovations in Graph Theory
2026-05-11Paper
Disconnected common graphs via supersaturation
The Electronic Journal of Combinatorics
2026-04-29Paper
Optimal and Near-Optimal Constructions for Bootstrap Percolation in Hypercubes
(available as arXiv preprint)
2026-01-01Paper
On Tournament Anti-Sidorenko Orientations of Trees
(available as arXiv preprint)
2026-01-01Paper
Sharp bounds for the fractional chromatic number of high-girth d-degenerate graphs
(available as arXiv preprint)
2026-01-01Paper
Orthogonal Pairs in Maps from the Sphere to the Circle
(available as arXiv preprint)
2026-01-01Paper
The Partial List Colouring Conjecture is False
(available as arXiv preprint)
2026-01-01Paper
The List Total Colouring Conjecture is False
(available as arXiv preprint)
2026-01-01Paper
Common pairs of graphs
Combinatorics, Probability and Computing
2025-12-30Paper
Circle squaring with pieces of small boundary and low Borel complexity
Advances in Mathematics
2025-12-11Paper
An approximate counting version of the multidimensional Szemerédi theorem
Combinatorica
2025-12-08Paper
Six permutation patterns force quasirandomness
Discrete Analysis
2025-09-12Paper
Sidorenko-type inequalities for pairs of trees
Random Structures & Algorithms
2025-08-29Paper
Turán colourings in off-diagonal Ramsey multiplicity
The Electronic Journal of Combinatorics
2025-05-06Paper
Forcing Quasirandomness in a Regular Tournament
(available as arXiv preprint)
2025-01-01Paper
Disconnected Common Graphs via Supersaturation
(available as arXiv preprint)
2025-01-01Paper
Maximizing Alternating Paths via Entropy
(available as arXiv preprint)
2025-01-01Paper
On Alternating 6-Cycles in Edge-Coloured Graphs
(available as arXiv preprint)
2025-01-01Paper
Cycles of length three and four in tournaments
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Off-diagonal commonality of graphs via entropy
SIAM Journal on Discrete Mathematics
2024-08-28Paper
Forcing quasirandomness with 4-point permutations
(available as arXiv preprint)
2024-01-01Paper
An Approximate Counting Version of the Multidimensional Szemer\'edi Theorem2023-11-22Paper
Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three
SIAM Journal on Discrete Mathematics
2023-09-27Paper
Off-Diagonal Commonality of Graphs via Entropy2023-07-07Paper
Off-Diagonal Ramsey Multiplicity2023-06-29Paper
On the running time of hypergraph bootstrap percolation
The Electronic Journal of Combinatorics
2023-06-27Paper
Sidorenko-Type Inequalities for Pairs of Trees2023-05-25Paper
Disconnected Common Graphs via Supersaturation2023-03-16Paper
Six Permutation Patterns Force Quasirandomness2023-03-08Paper
Recolouring homomorphisms to triangle-free reflexive graphs
Journal of Algebraic Combinatorics
2023-03-02Paper
Off-Diagonal Ramsey Multiplicity
(available as arXiv preprint)
2023-01-01Paper
Density maximizers of layered permutations
The Electronic Journal of Combinatorics
2022-10-06Paper
Common Pairs of Graphs2022-08-03Paper
Non-bipartite \(k\)-common graphs
Combinatorica
2022-06-30Paper
Pirates in wonderland: liquid democracy has bicriteria guarantees
(available as arXiv preprint)
2022-06-01Paper
Graph homomorphism reconfiguration and frozen \(H\)-colorings
Journal of Graph Theory
2022-03-31Paper
Circle Squaring with Pieces of Small Boundary and Low Borel Complexity2022-02-03Paper
A sharp threshold for bootstrap percolation in a random hypergraph
Electronic Journal of Probability
2021-07-21Paper
Cyclic coloring of plane graphs with maximum face size 16 and 17
European Journal of Combinatorics
2021-04-14Paper
Bounding the number of cycles in a graph in terms of its degree sequence
European Journal of Combinatorics
2021-02-08Paper
Characterization of quasirandom permutations by a pattern sum
Random Structures & Algorithms
2021-01-05Paper
Finitely forcible graphons with an almost arbitrary structure
Discrete Analysis
2020-10-20Paper
Cycles of length three and four in tournaments
Journal of Combinatorial Theory. Series A
2020-07-03Paper
Non-bipartite k-common graphs
(available as arXiv preprint)
2020-06-16Paper
Reconfiguring graph homomorphisms on the sphere
European Journal of Combinatorics
2020-04-09Paper
Weak regularity and finitely forcible graph limits
Transactions of the American Mathematical Society
2018-03-28Paper
Extremal bounds for bootstrap percolation in the hypercube
Journal of Combinatorial Theory. Series A
2018-03-02Paper
Extremal bounds for bootstrap percolation in the hypercube
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Extremal bounds for bootstrap percolation in the hypercube
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Supersaturation in posets and applications involving the container method
Journal of Combinatorial Theory. Series A
2017-11-09Paper
Supersaturation in posets and applications involving the container method
Journal of Combinatorial Theory. Series A
2017-11-09Paper
Saturation in the hypercube and bootstrap percolation
Combinatorics, Probability and Computing
2017-10-10Paper
Weak regularity and finitely forcible graph limits
(available as arXiv preprint)
2016-10-14Paper
Weak regularity and finitely forcible graph limits2016-10-14Paper
A dichotomy theorem for circular colouring reconfiguration
Theoretical Computer Science
2016-06-30Paper
Mixing homomorphisms, recolorings, and extending circular precolorings
Journal of Graph Theory
2016-02-01Paper
Mixing homomorphisms, recolorings, and extending circular precolorings
Journal of Graph Theory
2016-02-01Paper
A proof of a conjecture of Ohba
Journal of Graph Theory
2015-05-22Paper
A proof of a conjecture of Ohba
Journal of Graph Theory
2015-05-22Paper
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
European Journal of Combinatorics
2014-10-08Paper
On saturated k-Sperner systems
The Electronic Journal of Combinatorics
2014-09-04Paper
On saturated k-Sperner systems
The Electronic Journal of Combinatorics
2014-09-04Paper
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond2013-09-01Paper
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond
(available as arXiv preprint)
2013-01-01Paper
Extending precolourings of circular cliques
Discrete Mathematics
2012-01-11Paper


Research outcomes over time


This page was built for person: Jonathan A. Noel