Jaroslav Nešetřil
Biographic Data
| ID | 7706337 |
|---|---|
| NAME | Jaroslav Nešetřil |
| GIVEN NAMES | Jaroslav |
| FAMILY NAME | Nešetřil |
| SIGNATURE | NEŠETŘIL J |
| AFFILIATIONS | Charles University |
| ORCID | 0000-0002-5133-5586 |
| VERIFIED | Yes |
| TOTAL WORKS | 27 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 26 |
| WORKS AS EDITOR | 1 |
| FIRST PUBLICATION YEAR | 2003 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 0 |
Combinatorial Game Theory
Approximations of Mappings
Algorithmic Applications
Bounded Height Trees and Tree-Depth
A Few Problems
Decomposition
Further Directions
First-Order Constraint Satisfaction Problems, Limits and Homomorphism Dualities
Counting
Restricted Homomorphism Dualities
Independence
Property Testing, Hyperfiniteness and Separators
Some Applications
Prolegomena
Preservation Theorems
Measuring Sparsity
Back to Classes
Classes and Their Classification
Classes with Bounded Expansion – Examples
Solutions and Hints for some of the Exercises
Core Algorithms
Sparsity
Extremal Problems for Sparse Graphs
From sparse graphs to nowhere dense structures
This paper surveys the recent research related to the structural properties of sparse graphs and general finite relational structures. We provide a classification of classes of finite relational structures which is defined by means of a sequence of derived classes (defined by local changes). The resulting classification is surprisingly robust and it leads to many equivalent formulations which play an important role in applications in model theory…
Structural Properties of Sparse Graphs
No prominent works on this page.
Colorings and Homomorphisms of Minor Closed Classes
Topics in Discrete Mathematics
Structural Properties of Sparse Graphs
Extremal Problems for Sparse Graphs
From sparse graphs to nowhere dense structures
This paper surveys the recent research related to the structural properties of sparse graphs and general finite relational structures. We provide a classification of classes of finite relational structures which is defined by means of a sequence of derived classes (defined by local changes). The resulting classification is surprisingly robust and it leads to many equivalent formulations which play an important role in applications in model theory…
Algorithmic Applications
Bounded Height Trees and Tree-Depth
A Few Problems
Decomposition
Further Directions
First-Order Constraint Satisfaction Problems, Limits and Homomorphism Dualities
Counting
Restricted Homomorphism Dualities
Independence
Property Testing, Hyperfiniteness and Separators
Some Applications
Prolegomena
Preservation Theorems
Measuring Sparsity
Back to Classes
Classes and Their Classification
Classes with Bounded Expansion – Examples
Solutions and Hints for some of the Exercises
Core Algorithms
Sparsity
Mathematics (19 works) · Computer Science (17 works) · Advanced Graph Theory Research (10 works) · Combinatorics (10 works) · Graph (7 works) · Discrete mathematics (6 works) · Homomorphism (5 works) · Mathematical analysis (5 works) · Advanced Topology and Set Theory (4 works) · Algorithm (4 works)