Embeddings and the trace of finite sets

DOI10.1016/S0020-0190(98)00111-2zbMath1338.68206MaRDI QIDQ293357

F. Blanchet-Sadri, M. Dambrine

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001112?np=y

zbMATH Keywords

combinatorial problems: traces of set systemsisometrical embeddings

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Two results about the hypercube ⋮ Shattering, graph orientations, and connectivity ⋮ On partial cubes, well-graded families and their duals with some applications in graphs ⋮ Shattering-extremal set systems of small VC-dimension ⋮ Shattering-extremal set systems of VC dimension at most 2 ⋮ Some Combinatorial Applications of Gröbner Bases ⋮ Labeled Compression Schemes for Extremal Classes

Cites Work

• On the density of sets of vectors
• On the trace of finite sets
• Defect Sauer results
• On the density of families of sets
• Probably Approximate Learning of Sets and Functions
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embeddings and the trace of finite sets