Minimum number of affine simplices of given dimension

DOI10.1016/j.dam.2014.07.025zbMath1303.05204arXiv1309.6491OpenAlexW2056508758MaRDI QIDQ476315

Zsolt Tuza, István Szalkai

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6491

zbMATH Keywords

extremal set theorystoichiometrylinear hypergraphEuclidean affine simplexminimal linear dependency

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Cites Work

• Counting minimal reactions with specific conditions in \(\mathbb R^4\)
• Counting simplexes in \(\mathbb{R}^3\)
• What we know and what we do not know about Turán numbers
• Logarithmic order of free distributive lattice
• On the Minimal Density of Triangles in Graphs
• On generalized graphs
• A short proof of Sperner's lemma
• Triangles in an Ordinary Graph
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Upper bounds for Turán numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum number of affine simplices of given dimension