Embeddings and the trace of finite sets
From MaRDI portal
Publication:293357
DOI10.1016/S0020-0190(98)00111-2zbMATH Open1338.68206MaRDI QIDQ293357FDOQ293357
Authors: G. Greco 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the density of families of sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the density of sets of vectors
- On the trace of finite sets
- Defect Sauer results
- Probably Approximate Learning of Sets and Functions
- Title not available (Why is that?)
Cited In (13)
- Optimal multivalued shattering
- Shattering, graph orientations, and connectivity
- Shattering news
- Some combinatorial applications of Gröbner bases
- Some best possible bounds concerning the traces of finite sets. II
- Embedding theorems for the traces of grid functions in three dimensions
- Shattering-extremal set systems of VC dimension at most 2
- Shattering-extremal set systems of small VC-dimension
- Embeddings through discrete sets of balls
- Two results about the hypercube
- Shattering and more: Extending the complete object
- Labeled compression schemes for extremal classes
- On partial cubes, well-graded families and their duals with some applications in graphs
This page was built for publication: Embeddings and the trace of finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293357)
