On colorings of hypergraphs embeddable in R^d
From MaRDI portal
Publication:7363891
Cites work
- 2-list-coloring planar graphs without monochromatic triangles
- A higher dimensional version of Fáry's theorem
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Characterizations of Radon partitions
- Chromatic numbers of simplicial manifolds
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
- Coloring BIBDs with block size 4
- Coloring face hypergraphs on surfaces
- Coloring face-hypergraphs of graphs on surfaces
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Coloring Steiner Triple Systems
- Embeddings of a graph into a surface with different weak chromatic numbers
- Extremal problems for geometric hypergraphs
- Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
- Hardness of embedding simplicial complexes in R^d
- scientific article; zbMATH DE number 3850090 (Why is no real title available?)
- scientific article; zbMATH DE number 3749892 (Why is no real title available?)
- scientific article; zbMATH DE number 3303053 (Why is no real title available?)
- Indecomposable Coverings
- Lectures on Polytopes
- On balanced incomplete block designs with specified weak chromatic number
- On counting triangulations in d dimensions
- On the rectilinear crossing number of complete uniform hypergraphs
- Primitive Radon partitions for cyclic polytopes
- Regularity and Positional Games
- Stable sets in flag spheres
- The higher Stasheff‐Tamari posets
- Transversal numbers of stacked spheres
- Triangulations. Structures for algorithms and applications
This page was built for publication: On colorings of hypergraphs embeddable in \(\mathbb{R}^d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363891)
