How unproportional must a graph be?

DOI10.1016/j.ejc.2018.05.007zbMath1393.05242arXiv1404.1206OpenAlexW2962916897MaRDI QIDQ1663804

Oleg Pikhurko, Humberto Naves, Alexander D. Scott

Publication date: 24 August 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.1206

zbMATH Keywords

binomial random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersections of hypergraphs
• The asymptotic distributions of generalized U-statistics with applications to random graphs
• A central limit theorem for decomposable random variables with applications to random graphs
• σ-algebras for quasirandom hypergraphs
• Weak quasi-randomness for uniform hypergraphs
• Intersections of graphs
• A functional limit theorem for random graphs with applications to subgraph count statistics
• Cutting a graph into two dissimilar halves
• Proportional graphs
• Probabilistic construction of proportional graphs
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Existence of proportional graphs
• A graph Fourier transform and proportional graphs
• The poset of hypergraph quasirandomness
• Imbalances in k‐colorations
• Quasi-random graphs
• Graph norms and Sidorenko's conjecture

This page was built for publication: How unproportional must a graph be?