Random hypergraphs in pseudofinite fields
From MaRDI portal
Abstract: We construct a random -hypergraph for every , in a given pseudofinite field.
Recommendations
- On testing the `pseudo-randomness' of a hypergraph
- A clique-free pseudorandom subgraph of the pseudo polarity graph
- A Paley-like graph in characteristic two
- Pseudorandom Graphs from Elliptic Curves
- On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
- Quasi-random hypergraphs
- Bipartite subgraphs and quasi-randomness
- Infinite Paley graphs
- Model theory of finite fields and pseudo-finite fields
- Monadic structures over an ordered universal random graph and finite automata
Cites work
- Algebraic Function Fields and Codes
- Alternating group coverings of the affine line for characteristic greater than two
- Alternating group coverings of the affine line for characteristic two
- Galois theory on the line in nonzero characteristic
- scientific article; zbMATH DE number 3390942 (Why is no real title available?)
- The elementary theory of finite fields
Cited in
(7)- A survey of homogeneous structures
- On n-dependence
- On n-dependent groups and fields
- \(\mathrm{VC}_{\ell }\)-dimension and the jump to the fastest speed of a hereditary \(\mathcal {L}\)-property
- scientific article; zbMATH DE number 2196516 (Why is no real title available?)
- Weakly binary expansions of dense meet‐trees
- The Grothendieck constant of random and pseudo-random graphs
This page was built for publication: Random hypergraphs in pseudofinite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655739)