4 citations · 4 across the 3 of their papers we have counts for
7 papers · 1 filter
Forcing Quasirandomness in a Regular Tournament
Jonathan A. Noel, Arjun Ranganathan, Lina M. Simbaqueba
A tournament is said to force quasirandomness if it has the property that a sequence of tournaments of increasing orders is quasirandom if and only if…
An Approximate Counting Version of the Multidimensional Szemerédi Theorem
Natalie Behague, Joseph Hyde, Natasha Morrison +2
For any fixed and subset of , let be the maximum cardinality of a subset of which does not contain a subset of the form $\…
Bounding the number of cycles in a graph in terms of its degree sequence
Zdeněk Dvořák, Natasha Morrison, Jonathan A. Noel +2
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Király and Arman and Tsatur…
Cycles of length three and four in tournaments
Timothy F. N. Chan, Andrzej Grzesik, Daniel Kral +1
Linial and Morgenstern conjectured that, among all -vertex tournaments with cycles of length three, the number of cycles of length four is asymptotically minimiz…
Finitely forcible graphons with an almost arbitrary structure
Daniel Kral, László Miklós Lovász, Jonathan A. Noel +1
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities,…
A Sharp Threshold for Bootstrap Percolation in a Random Hypergraph
Natasha Morrison, Jonathan A. Noel
Given a hypergraph , the -bootstrap process starts with an initial set of infected vertices of and, at each step, a healthy vertex becom…