The following pages link to Jonathan A. Noel (Q301587):
Displaying 32 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Weak regularity and finitely forcible graph limits (Q322209) (← links)
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Extending precolourings of circular cliques (Q658016) (← links)
- Cycles of length three and four in tournaments (Q778712) (← links)
- Supersaturation in posets and applications involving the container method (Q1679331) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- A sharp threshold for bootstrap percolation in a random hypergraph (Q2042875) (← links)
- Density maximizers of layered permutations (Q2088699) (← links)
- Non-bipartite \(k\)-common graphs (Q2151175) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- Pirates in wonderland: liquid democracy has bicriteria guarantees (Q2670943) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- Characterization of quasirandom permutations by a pattern sum (Q3386522) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- Weak regularity and finitely forcible graph limits (Q4608759) (← links)
- Graph homomorphism reconfiguration and frozen H‐colorings (Q5066895) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- Saturation in the Hypercube and Bootstrap Percolation (Q5366935) (← links)
- Extremal bounds for bootstrap percolation in the hypercube (Q5915829) (← links)
- Extremal bounds for bootstrap percolation in the hypercube (Q5970282) (← links)
- Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three (Q6077983) (← links)
- On the running time of hypergraph bootstrap percolation (Q6106304) (← links)
- Non-bipartite k-common graphs (Q6343067) (← links)
- Tur\'an Colourings in Off-Diagonal Ramsey Multiplicity (Q6512992) (← links)
- Off-diagonal commonality of graphs via entropy (Q6594391) (← links)
- Cycles of length three and four in tournaments (Q6621178) (← links)
- Forcing quasirandomness with 4-point permutations (Q6735818) (← links)
- Forcing Quasirandomness in a Regular Tournament (Q6763937) (← links)
