2 papers
math.CO2025
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…
math.CO2025
Sidorenko-Type Inequalities for Pairs of Trees
Natalie Behague, Gabriel Crudele, Jonathan A. Noel +1
Given two non-empty graphs and , write to mean that for every graph , where is the homomorphism d…