Graphons arising from graphs definable over finite fields
From MaRDI portal
Recommendations
Cites work
- A note on groups definable in difference fields
- A survey of asymptotic classes and measurable structures
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- ACFA and measurability
- APPLICATIONS OF THE GROUP CONFIGURATION THEOREM IN SIMPLE THEORIES
- CONSTRUCTING AN ALMOST HYPERDEFINABLE GROUP
- Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
- Group configurations and germs in simple theories
- scientific article; zbMATH DE number 32406 (Why is no real title available?)
- scientific article; zbMATH DE number 493070 (Why is no real title available?)
- Large networks and graph limits
- Model theory of difference fields
- One-dimensional asymptotic classes of finite structures
- Pseudofinite structures and simplicity
- Regularity lemma for distal structures
- Regularity lemmas for stable graphs
- Simple theories
- Simple theories and hyperimaginaries
- Szemerédi's lemma for the analyst
- Szemerédi's regularity Lemma for matrices and sparse graphs
- Szemerédi's regularity lemma for sparse graphs
Cited in
(5)- Paley-like graphs over finite fields from vector spaces
- A finite complete set of equations generating graphs
- scientific article; zbMATH DE number 2058289 (Why is no real title available?)
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- When invariance implies exchangeability (and applications to invariant Keisler measures)
This page was built for publication: Graphons arising from graphs definable over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090259)