Avoidable algebraic subsets of Euclidean space
DOI10.1090/S0002-9947-99-02331-4zbMATH Open0948.03045OpenAlexW1587175384MaRDI QIDQ4955693FDOQ4955693
Publication date: 22 May 2000
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-99-02331-4
Recommendations
- Classifying unavoidable Tverberg partitions
- Counting the number of unavoidable sets of a given size in a finite set of integers
- Asymptotic results on Klazar set partition avoidance
- Publication:5753200
- Set partition patterns and the dimension index
- scientific article; zbMATH DE number 3951186
- Set partition patterns and statistics
- scientific article; zbMATH DE number 1790528
- Chromatic polynomials and \(k\)-trees
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
infinite combinatoricsalgebraic setsavoidable polynomialsmaster partitionpartition of Euclidean \(n\)-space
Partitions of sets (05A18) Other combinatorial set theory (03E05) Euclidean geometries (general) and generalizations (51M05) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cites Work
- Title not available (Why is that?)
- Tetrahedron Free Decomposition of R3
- Combinatorial set theory: Partition relations for cardinals
- On non-denumerable graphs
- Partitioning Euclidean space
- A Decomposition Theorem for R n
- Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Triangle-Free Partitions of Euclidean Space
- Countable partitions of Euclidean space
- Partitioning Euclidean space
- Alfred Tarski's elimination theory for real closed fields
- Partitions of vector spaces
- Title not available (Why is that?)
Cited In (11)
- Chromatic numbers of algebraic hypergraphs
- An infinite color analogue of Rado's theorem
- DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS
- Coloring the distance graphs
- Krull dimension in set theory
- Coloring triangles and rectangles
- The first omega alephs: from simplices to trees of trees to higher walks
- Coloring closed Noetherian graphs
- A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids
- Avoiding Multiple Repetitions in Euclidean Spaces
- Some algebraic equivalent forms of $\mathbb {R}\subseteq L$
This page was built for publication: Avoidable algebraic subsets of Euclidean space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955693)
