Weak randomness in graphons and theons
From MaRDI portal
Cites work
- σ-algebras for quasirandom hypergraphs
- A combinatorial problem; stability and order for models and theories in infinitary languages
- Characterization of quasirandom permutations by a pattern sum
- Erdős–Hajnal for graphs with no 5‐hole
- Extension of hereditary classes with substitutions
- Flag algebras
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- Hypergraphs, quasi-randomness, and conditions for regularity
- Large networks and graph limits
- Limits of dense graph sequences
- Model theory.
- Natural quasirandomness properties
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- On the closure of graphs under substitution
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasirandom permutations
- Quasirandom permutations are characterized by 4-point densities
- Quasirandomness in hypergraphs
- Quasi‐random classes of hypergraphs
- Ramsey-type theorems
- Ramsey-type theorems with forbidden subgraphs
- Regularity partitions and the topology of graphons
- Semantic limits of dense combinatorial objects
- The Erdős-Hajnal conjecture for bull-free graphs
- The Erdős-Hajnal conjecture. A survey
- The poset of hypergraph quasirandomness
- The strong perfect graph theorem
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
This page was built for publication: Weak randomness in graphons and theons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027478)
