Ample simplicial complexes
From MaRDI portal
Publication:2115328
DOI10.1007/s40879-021-00521-5zbMath1485.05186arXiv2012.01483OpenAlexW4205823744MaRDI QIDQ2115328
Chaim Even-Zohar, Lewis Mead, Michael S. Farber
Publication date: 15 March 2022
Published in: European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.01483
Network design and communication in computer systems (68M10) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Networks beyond pairwise interactions: structure and dynamics
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property
- Vertex-transitive self-complementary uniform hypergraphs of prime order
- Homogeneous factorisations of complete graphs with edge-transitive factors
- Graphs which contain all small graphs
- Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
- Equations over finite fields. An elementary approach
- Lower bounds of Ramsey numbers based on cubic residues
- Pseudo-random hypergraphs
- The Rado simplicial complex
- Random simplicial complexes in the medial regime
- Quantitative aspects of acyclicity
- Vertex-transitive self-complementary uniform hypergraphs
- A class of self-complementary graphs and lower bounds of some ramsey numbers
- Pseudo-random properties of self-complementary symmetric graphs
- Properties of almost all graphs and complexes
- On Character Sums and Primitive Roots†
- Paley graphs satisfy all first-order adjacency axioms
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- Probabilities on finite models
- Random Simplicial Complexes
- Quasi-Random Set Systems
- New lower bounds of some diagonal Ramsey numbers
- On the Brun–Titchmarsh theorem
- Random simplicial complexes, duality and the critical dimension
- The poset of hypergraph quasirandomness
- Zero-one laws with variable probability
- Universal graphs and universal functions
- A Constructive Solution to a Tournament Problem
- The random graph
- Asymmetric graphs
- All self-complementary symmetric graphs
This page was built for publication: Ample simplicial complexes
