Implicit representation of sparse hereditary families
From MaRDI portal
Publication:6624164
DOI10.1007/s00454-023-00521-0MaRDI QIDQ6624164
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotically optimal induced universal graphs
- The structure of almost all graphs in a hereditary property
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Norm-graphs: Variations and applications
- Discrepancy and approximations for bounded VC-dimension
- Quasi-optimal range searching in spaces of finite VC-dimension
- Integer realizations of disk and segment graphs
- On the density of families of sets
- The number of polytopes, configurations and real matroids
- On the entropy values of hereditary classes of graphs
- Implicat Representation of Graphs
- Sign rank versus Vapnik-Chervonenkis dimension
- On minimal n-universal graphs
- Lower Bounds for Approximation by Nonlinear Manifolds
- On the Betti Numbers of Real Varieties
- On a problem of K. Zarankiewicz
- Optimal labelling schemes for adjacency, comparability, and reachability
This page was built for publication: Implicit representation of sparse hereditary families
