A Combinatorial Approach to Colourful Simplicial Depth

DOI10.1137/130913031zbMath1292.05199arXiv1212.4720OpenAlexW2964094479MaRDI QIDQ4979841

Frédéric Meunier, Pauline Sarrabezolles, Antoine Deza

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

realizabilitycolourful Carathéodory theoremcolourful simplicial depthoctahedral systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Helly-type theorems and geometric transversal theory (52A35) Combinatorial complexity of geometric structures (52C45)

Related Items (2)

A note on lower bounds for colourful simplicial depth ⋮ The colourful simplicial depth conjecture

This page was built for publication: A Combinatorial Approach to Colourful Simplicial Depth