Quasi-Random Oriented Graphs
From MaRDI portal
Publication:2853337
DOI10.1002/jgt.21701zbMath1273.05203arXiv1101.5421OpenAlexW1893778160MaRDI QIDQ2853337
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
Related Items (8)
Cut distance identifying graphon parameters over weak* limits ⋮ Extremal results on feedback arc sets in digraphs ⋮ Interlacing families and the Hermitian spectral norm of digraphs ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ 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 ⋮ On the Density of Transitive Tournaments
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
This page was built for publication: Quasi-Random Oriented Graphs