Gabriel Crudele

collaborators

3 papers

math.PR2025

Universal diameter bounds for random graphs with given degrees

Louigi Addario-Berry, Gabriel Crudele

Given a graph $G$ , let $diam (G)$ be the greatest distance between any two vertices of $G$ which lie in the same connected component, and let $diam^{+} (G)$ be the gr…

math.CO2025

Sidorenko-Type Inequalities for Pairs of Trees

Natalie Behague, Gabriel Crudele, Jonathan A. Noel +1

Given two non-empty graphs $H$ and $T$ , write $H ≽ T$ to mean that $t (H, G)^{∣ E (T) ∣} \geq t (T, G)^{∣ E (H) ∣}$ for every graph $G$ , where $t (\cdot, \cdot)$ is the homomorphism d…

math.CO2024

Six Permutation Patterns Force Quasirandomness

Gabriel Crudele, Peter Dukes, Jonathan A. Noel

A sequence $I ¨ _{1}, I ¨ _{2}, \dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $I ¨ $ in $I ¨ _{n}$ converges to $1/∣ I ¨ ∣!$ as $n \to \infty$ . We prove…