The following pages link to Structural sparsity (Q2815673):
Displaying 21 items.
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Sparse versus simple structure loadings (Q888031) (← links)
- Invariant measures via inverse limits of finite structures (Q896078) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- Mapping planar graphs into the Coxeter graph (Q898148) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Harary polynomials (Q5056203) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- Local-global convergence, an analytic and structural approach (Q5227148) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
