Quasi-Random Oriented Graphs

DOI10.1002/jgt.21701zbMath1273.05203arXiv1101.5421MaRDI QIDQ2853337

Simon Griffiths

Publication date: 21 October 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

oriented graphs; quasi-randomness

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

FORCING QUASIRANDOMNESS WITH TRIANGLES, On the Density of Transitive Tournaments, Interlacing families and the Hermitian spectral norm of digraphs, On the maximum density of fixed strongly connected subtournaments, Tournament quasirandomness from local counting, On the largest eigenvalue of a mixed graph with partial orientation, Cut distance identifying graphon parameters over weak* limits

Cites Work

• Unnamed Item
• Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
• Quasi-randomness and the distribution of copies of a fixed graph
• Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
• Quasi-randomness of graph balanced cut properties
• Subgraphs of Weakly Quasi-Random Oriented Graphs
• The quasi-randomness of hypergraph cut properties
• Quasi-random tournaments
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Quasi‐random classes of hypergraphs
• Quasi-Random Set Systems
• Quasi-random graphs