Jaroslav Nešetřil | Academic Influence

Jaroslav Nešetřil's AcademicInfluence.com Rankings

Jaroslav Nešetřil

Mathematics

#504

World Rank

#982

Historical Rank

Measure Theory

#1016

World Rank

#1311

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Jaroslav Nešetřil's Degrees

PhD Mathematics Charles University

Why Is Jaroslav Nešetřil Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jaroslav Nešetřil is a Czech mathematician, working at Charles University in Prague. His research areas include combinatorics , graph theory , algebra , posets , computer science . Education and career Nešetřil received his Ph.D. from Charles University in 1973 under the supervision of Aleš Pultr and Gert Sabidussi. He is responsible for more than 300 publications. Since 2006, he is chairman of the Committee of Mathematics of Czech Republic .

(See a Problem?)

Jaroslav Nešetřil's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Graphs and homomorphisms (2004) (926)
On the complexity of H-coloring (1990) (686)
Sparsity - Graphs, Structures, and Algorithms (2012) (348)
Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history (2001) (334)
On the complexity of the subgraph problem (1985) (252)
Tree-depth, subgraph coloring and homomorphism bounds (2006) (248)
The core of a graph (1992) (227)
Grad and classes with bounded expansion I. Decompositions (2005) (223)
Partitions of Finite Relational and Set Systems (1977) (182)
Invitation to discrete mathematics (1998) (174)
Graph colorings (2005) (164)
The Ramsey property for graphs with forbidden complete subgraphs (1976) (154)
Constraint Satisfaction with Countable Homogeneous Templates (2003) (142)
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations) (2000) (139)
On nowhere dense graphs (2011) (138)
On classes of relations and graphs determined by subobjects and factorobjects (1978) (121)
Grad and classes with bounded expansion II. Algorithmic aspects (2005) (121)
Duality and Polynomial Testing of Tree Homomorphisms (1996) (115)
The Mathematics of Paul Erdős II (1997) (113)
Ramsey Classes and Homogeneous Structures (2005) (112)
Ramsey Classes of Set Systems (1983) (111)
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities (2008) (107)
On the maximum average degree and the oriented chromatic number of a graph (1999) (99)
Colorings and Homomorphisms of Minor Closed Classes (2003) (98)
Colouring, constraint satisfaction, and complexity (2008) (88)
First order properties on nowhere dense structures (2010) (88)
A short proof of the existence of highly chromatic hypergraphs without short cycles (1979) (84)
Characterisations and examples of graph classes with bounded expansion (2009) (82)
Homomorphism-Homogeneous Relational Structures (2006) (81)
Metric spaces are Ramsey (2007) (78)
Combinatorial partitions of finite posets and lattices —Ramsey lattices (1984) (78)
Colorings and girth of oriented planar graphs (1997) (75)
The partite construction and ramsey set systems (1989) (71)
Linear time low tree-width partitions and algorithmic consequences (2006) (69)
Mathematics of Ramsey Theory (1991) (67)
Folding (2006) (66)
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) (2019) (66)
Colored Homomorphisms of Colored Mixed Graphs (2000) (65)
When Trees Grow Low: Shrubs and Fast MSO1 (2012) (63)
Rainbow Arithmetic Progressions and Anti-Ramsey Results (2003) (62)
First-Order Interpretations of Bounded Expansion Classes (2018) (60)
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (2008) (57)
On a product dimension of graphs (1980) (56)
On a probabilistic graph-theoretical method (1978) (56)
Complexity of Tree Homomorphisms (1996) (54)
Simple proof of the existence of restricted ramsey graphs by means of a partite construction (1981) (53)
Chromatically optimal rigid graphs (1989) (49)
On the Oriented Game Chromatic Number (2000) (49)
For graphs there are only four types of hereditary Ramsey classes (1989) (48)
On the Maximum Weight Clique Problem (1987) (48)
Grad and classes with bounded expansion III. restricted dualities (2005) (48)
ASPECTS OF STRUCTURAL COMBINATORICS (Graph Homomorphisms and Their Use) (1999) (48)
On sparse graphs with given colorings and homomorphisms (2004) (46)
The complexity of H-colouring of bounded degree graphs (2000) (46)
Noncrossing Subgraphs in Topological Layouts (1991) (44)
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality (2005) (44)
Shrub-depth: Capturing Height of Dense Graphs (2017) (43)
The acyclic edge chromatic number of a random d‐regular graph is d + 1 (2005) (41)
On Low Tree-Depth Decompositions (2014) (40)
The structure of critical Ramsey graphs (1978) (38)
Universal partial order represented by means of oriented trees and other simple graphs (2005) (38)
Surveys in Combinatorics: Partition theory and its applications (1979) (37)
Algorithms - ESA’ 99 (2003) (36)
Ramsey theory (1996) (35)
Counting List Homomorphisms and Graphs with Bounded Degrees (2001) (35)
Either tournaments or algebras? (1975) (35)
A structural generalization of the Ramsey theorem (1977) (34)
The acyclic edge chromatic number of a random d-regular graph is d + 1 (2005) (34)
Local k-colorings of graphs and hypergraphs (1987) (34)
Finite presentation of homogeneous graphs, posets and Ramsey classes (2005) (33)
Graphs and k-Societies (1970) (33)
On the use of senders in generalized ramsey theory for graphs (1985) (32)
Finite Paths are Universal (2004) (31)
Complexity of diagrams (1987) (31)
On the Computational Complexity of Seidel's Switching (1992) (31)
Structural Properties of Sparse Graphs (2008) (31)
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph (1978) (31)
Automorphism groups and Ramsey properties of sparse graphs (2018) (30)
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number (1999) (28)
Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth (1998) (28)
Homomorphisms of derivative graphs (1971) (28)
Representations of Graphs by Means of Products and Their Complexity (1981) (27)
A Dushnik - Miller Type Dimension of Graphs and its Complexity (1977) (27)
From Sparse Graphs to Nowhere Dense Structures: Decompositions, Independence, Dualities and Limits (2010) (27)
On bounded treewidth duality of graphs (1996) (27)
Topological, Algebraical and Combinatorial Structures: Frolik's Memorial Volume (1993) (27)
Strong Ramsey theorems for Steiner systems (1987) (26)
Homomorphism and Embedding Universal Structures for Restricted Classes (2009) (26)
On Locally Presented Posets (1990) (26)
On universal graphs for planar oriented graphs of a given girth (1998) (26)
On the order of countable graphs (2003) (25)
The Grad of a Graph and Classes with Bounded Expansion (2005) (24)
Colorings and homomorphisms of degenerate and bounded degree graphs (2001) (24)
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs (1982) (24)
A Model Theory Approach to Structural Limits (2013) (23)
Colouring Relatives of Intervals on the Plane, II (1998) (23)
A Note on Boolean Dimension of Posets (1989) (23)
A few remarks on the history of MST-problem (1997) (23)
The Homomorphism Structure of Classes of Graphs (1999) (23)
Rainbow Ramsey Theory (2005) (23)
Partitions of graphs into cographs (2002) (22)
Forbidden lifts (NP and CSP for combinatorialists) (2007) (22)
A Combinatorial Classic — Sparse Graphs with High Chromatic Number (2013) (21)
Chromatic number of Hasse diagrams, eyebrows and dimension (1991) (20)
A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (2013) (20)
Rankwidth meets stability (2020) (20)
More About Subcolorings (2002) (20)
Sparse ramsey graphs (1984) (19)
Twin-width and permutations (2021) (19)
Canonizing Ordering Theorems for Hales Jewett Structures (1985) (19)
Two proofs in combinatorial number theory (1985) (19)
An unprovable Ramsey-type theorem (1992) (19)
Calculating sequence-dependent melting stability of duplex DNA oligomers and multiplex sequence analysis by graphs. (2001) (19)
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder (1997) (18)
Universal H-colorable graphs without a given configuration (2002) (18)
Partite Construction and Ramsey Space Systems (1990) (17)
Vojtech Jarni'k's work in combinatorial optimization (2001) (17)
On maximal finite antichains in the homomorphism order of directed graphs (2003) (17)
On polynomial time decidability of induced-minor-closed classes (1988) (17)
A Mock Theta Function for the Delta-function (2009) (17)
Ramsey properties and extending partial automorphisms for classes of finite structures (2017) (17)
Modeling Limits in Hereditary Classes: Reduction and Application to Trees (2013) (16)
A note on spatial representation of graphs (1985) (16)
A Probabilistic Approach to the Dichotomy Problem (2006) (16)
Bounded Height Trees and Tree-Depth (2012) (16)
Every finite graph is a full subgraph of a rigid graph (1971) (16)
Note on projective graphs (2004) (16)
Dualities in full homomorphisms (2010) (15)
A combinatorial proof of the extension property for partial isometries (2018) (15)
Linear rankwidth meets stability (2019) (15)
On tension-continuous mappings (2008) (15)
A finite presentation of the rational Urysohn space (2008) (15)
Universal Structures with Forbidden Homomorphisms (2009) (15)
AMALGAMATION OF GRAPHS AND ITS APPLICATIONS (1979) (15)
Cuts and bounds (2005) (14)
Antisymmetric flows in matroids (2006) (14)
Posets, Boolean Representations and Quick Path Searching (1987) (14)
A combinatorial constraint satisfaction problem dichotomy classification conjecture (2010) (14)
Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees) (1973) (14)
EPPA for two-graphs and antipodal metric spaces (2018) (14)
How many F's are there in G? (2011) (14)
A note on random homomorphism from arbitrary graphs to Z (2003) (14)
Antichains in the homomorphism order of graphs (2007) (14)
On Ramsey graphs without cycles of short odd lengths (1979) (13)
Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (1992) (13)
Homomorphisms of graphs and of their orientations (1978) (13)
Ramsey classes of topological and metric spaces (2006) (13)
Distinguishing graphs by their left and right homomorphism profiles (2011) (13)
The Origins of Minimal Spanning Tree Algorithms – Bor̊uvka and Jarńık (2012) (13)
On Pisier Type Problems and Results (Combinatorial Applications to Number Theory) (1990) (12)
Physics and Theoretical Computer Science: From Numbers and Languages to (Quantum) Cryptography (2007) (12)
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (2019) (12)
NP by Means of Lifts and Shadows (2007) (12)
Fraternal augmentations, arrangeability and linear Ramsey numbers (2009) (12)
Finite union theorem with restrictions (1986) (12)
Art of Drawing (1999) (12)
Structural sparsity (2016) (12)
A Ramsey-Type Theorem in the Plane (1994) (11)
Two remarks on Ramsey's theorem (1985) (11)
A dualistic approach to bounding the chromatic number of a graph (2008) (11)
Cohomomorphisms of graphs and hypergraphs (1979) (11)
$T$-preserving homomorphisms of oriented graphs (1997) (11)
Some Examples of Universal and Generic Partial Orders (2010) (11)
I. Schur, C.E. Shannon and Ramsey Numbers, a short story (2001) (11)
On Edge-maps whose Inverse Preserves Flows or Tensions (2006) (11)
Minimal universal and dense minor closed classes (2006) (10)
A congruence theorem for asymmetric trees (1971) (10)
Epidemiography II. Games with a dozing yet winning player (1988) (10)
A Ramsey Property of Order Types (1998) (10)
Construction of sparse graphs with prescribed circular colorings (2001) (10)
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (2010) (10)
Some Nonstandard Ramsey Like Applications (1984) (10)
Generalised Dualities and Finite Maximal Antichains (2006) (10)
A unified approach to structural limits (with application to the study of limits of graphs with bounded tree-depth) (2013) (10)
Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions (2002) (9)
Extendability, Dimensions, and Diagrams of Cycle Orders (1991) (9)
Bowtie-free graphs have a Ramsey lift (2014) (9)
Linearity and unprovability of set union problem (1988) (9)
Homomorphism bounded classes of graphs (2006) (9)
Invitation to Discrete Mathematics (2. ed.) (2009) (9)
EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (2016) (9)
The Erdős–Turán property for a class of bases (2004) (9)
Density of universal classes of series‐parallel graphs (2007) (9)
Quotients of rigid graphs (1981) (9)
Small Sets Satisfying the Central Sets Theorem (2009) (9)
THE PARTIAL ORDER OF GRAPHS AND HOMOMORPHISMS (2004) (8)
Efficient Representation of Taxonomies (1987) (8)
Many Facets of Dualities (2008) (8)
Complexities of Relational Structures (2013) (8)
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (2007) (8)
Clustering powers of sparse graphs (2020) (8)
Selective Graphs and Hypergraphs (1978) (8)
Graphs, Morphisms and Statistical Physics (2004) (8)
On symmetric and antisymmetric relations (1972) (8)
Fraternal Augmentations of graphs, Coloration and Minors (2007) (8)
A Ramsey class for Steiner systems (2016) (8)
The Finite Heine Transformation (2009) (8)
Geometry, Structure and Randomness in Combinatorics (2014) (8)
Another Proof of the Folkman-Rado-Sanders Theorem (1983) (8)
Ramsey Partial Orders from Acyclic Graphs (2016) (8)
Structural Properties of the First-Order Transduction Quasiorder (2020) (8)
Partite construction and Ramseyan theorems for sets, numbers and spaces (1987) (7)
Tension continuous maps - Their structure and applications (2005) (7)
Invariant measures via inverse limits of finite structures (2013) (7)
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs (1980) (7)
High Chromatic Rigid Graphs II (1982) (7)
Towards an Aesthetic Invariant for Graph Drawing (2001) (7)
H-Colorings of Large Degree Graphs (2002) (7)
A distributed low tree-depth decomposition algorithm for bounded expansion classes (2016) (7)
On Ramsey graphs without bipartite subgraphs (1992) (7)
The chromatic connectivity of graphs (1988) (7)
Infinite precise objects (1978) (6)
On reconstructing of infinite forests (1972) (6)
Statistics of orderings (2017) (6)
Large minimal sets which force long arithmetic progressions (1986) (6)
Random graphs and covering graphs of posets (1986) (6)
Density via duality (2002) (6)
Amalgamation of matroids and its applications (1981) (6)
Antisymmetric flows and edge-connectivity (2004) (6)
Complete and pseudocomplete colourings of a graph (1976) (6)
Homomorphisms and polynomial invariants of graphs (2007) (6)
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (1979) (6)
Ramsey classes with forbidden homomorphisms and a closure (2015) (6)
Polynomial graph invariants from homomorphism numbers (2013) (6)
First-order limits, an analytical perspective (2015) (6)
Minimal asymmetric graphs of induced length 4 (1992) (6)
Strongly polynomial sequences as interpretations (2014) (6)
On Finite Maximal Antichains in the Homomorphism Order (2007) (5)
A surprising permanence of old motivations (a not-so-rigid story) (2009) (5)
Advances in discrete mathematics and applications : Mysore, 2008 : proceedings of the International Conference on Discrete Mathematics (ICDM 2008), held at University of Mysore, Mysore (6-10 June, 2008) (2010) (5)
Embedding Graphs in Euclidean Spaces, an exploration guided by Paul Erd?s (1999) (5)
Three Remarks on Dimensions of Graphs (1985) (5)
Images of Rigid Digraphs (1991) (5)
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009) (2009) (5)
Big Ramsey degrees and forbidden cycles (2021) (5)
Cluster analysis of local convergent sequences of structures (2015) (5)
Topics in discrete mathematics : dedicated to Jarik Nešetřil on the occasion of his 60th birthday (2006) (5)
On oriented path double covers (2001) (5)
Ramsey Classes with Closure Operations (Selected Combinatorial Applications) (2017) (5)
Sparse Combinatorial Structures: Classification and Applications (2011) (5)
On first-order definable colorings (2014) (5)
All those EPPA classes (Strengthenings of the Herwig-Lascar theorem) (2019) (5)
Regular partitions of gentle graphs (2020) (5)
Postorder Hierarchy for Path Compressions and Set Union (1988) (5)
Combinatorial number theory : proceedings of the 'Integers Conference 2005' in celebration of the 70th birthday of Ronald Graham, Carrollton, Georgia, October 27-30, 2005 (2007) (5)
More on the complexity of cover graphs (2010) (5)
Colouring edges with many colours in cycles (2011) (4)
On characteristics of homomorphism and embedding universal graphs (2009) (4)
SELECTIVITY OF HYPERGRAPHS (1984) (4)
Interleaved adjoints of directed graphs (2009) (4)
On covers of graphs (2000) (4)
Combinatorics and quantifiers (1996) (4)
HOMOMORPHISMS OF STRUCTURES (CONCEPTS AND HIGHLIGHTS) (4)
on ordered Graphs and Graph orderings (1994) (4)
NP for Combinatorialists (2007) (4)
Limits of mappings (2016) (4)
Representing monoids by mappings preserving equivalences (1971) (4)
Sums and Differences of the Coordinates of Points on Modular Hyperbolas (2009) (4)
Art of Graph Drawing and Art (2002) (4)
On the Density of Integral Sets with Missing Differences (2009) (4)
Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness" (2009) (4)
A rigid graph for every set (2002) (4)
Algebraic graph theory - a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday (2012) (4)
A Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids (2000) (4)
Towards an arboretum of monadically stable classes of graphs (2020) (4)
Evaluation of total hepatocellular cancer lifespan, including both clinically evident and preclinical development, using combined network phenotyping strategy and fisher information analysis. (2015) (3)
Induced monochromatic subconfigurations (1997) (3)
Semigroups with the Erdös-Turán Property (2006) (3)
When is a random graph projective? (2006) (3)
Ramsey Theory in the Work of Paul Erdős (2013) (3)
Path homomorphisms, graph colorings, and boolean matrices (2010) (3)
Ramsey Classes with Closure Operations (2017) (3)
Fractal property of the graph homomorphism order (2016) (3)
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP) (1997) (3)
INDUCED MATCHINGS AND INDUCED PATHS IN GRAPHS (2007) (3)
The seventh European conference on combinatorics, graph theory and applications : Eurocomb 2013 (2013) (3)
Towards Mathematical Aesthetics ∗ (2004) (3)
A note on homomorphism-independent families (2001) (3)
Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory (2001) (3)
More about Subcolorings (Extended Abstract) (2002) (3)
On a conjecture of Erdős and Turán for additive basis (2008) (3)
Local-global convergence, an analytic and structural approach (2018) (3)
Graphs with small asymmetries (1970) (3)
Simple tournaments and sharply transitive groups (1992) (3)
Frobenius Numbers of Generalized Fibonacci Semigroups (2009) (3)
On critical uniquely colorable graphs (1972) (3)
Dualities and Dual Pairs in Heyting Algebras (2009) (3)
Extremal Problems for Sparse Graphs (2010) (2)
Bounds and Extrema for Classes of Graphs and Finite Structures (2006) (2)
Either tournaments or algebras? (Preliminary communication) (1972) (2)
Spectra, graphs, and proteins. Towards understanding of protein folding (1997) (2)
Colouring , Constraint Satisfaction , and Complexity For Aleš Pultr on the Occasion of his 70 th Birthday Pavol Hell (2008) (2)
Column-to-Row Operations on Partitions: The Envelopes (2009) (2)
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems (2014) (2)
Reorientations of covering graphs (1991) (2)
On the Edge-sets of Rigid and Corigid Graphs (1979) (2)
Contractors for flows (2010) (2)
On the first-order transduction quasiorder of hereditary classes of graphs (2022) (2)
The Existence Problem for Graph Homomorphisms (1988) (2)
A journey through discrete mathematics : a tribute to Jiří Matoušek (2017) (2)
Graph-indexed random walks on pseudotrees (2018) (2)
Finite dualities and map-critical graphs on a fixed surface (2012) (2)
A Journey Through Discrete Mathematics (2017) (2)
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations (2002) (2)
On the number of B-flows of a graph (2)
On sets of integers with the Schur property (1986) (2)
A note on Fiedler value of classes with sublinear separators (2012) (1)
THÉORIE DE RAMSEY STRUCTURALE ET APPLICATIONS EN DYNAMIQUE VIA LA CORRESPONDANCE DE KECHRIS-PESTOV-TODORCEVIC (2013) (1)
Finite Paths are Universal (2005) (1)
Classes of graphs with low complexity Nowhere Dense Structurally Nowhere Dense Structurally Bounded Expansion Bounded Expansion Bounded Treewidth Structurally Bounded Treewidth Bounded Pathwidth Structurally Bounded Pathwidth Bounded Treedepth Bounded Shrubdepth Monadically Stable Bounded Linear Ran (2019) (1)
On the Density of Trigraph Homomorphisms (2007) (1)
On the Euler Product of Some Zeta Functions (2009) (1)
Complexity of diagrams (1993) (1)
Conant's generalised metric spaces are Ramsey (2017) (1)
In praise of homomorphisms (2021) (1)
Entromics -- thermodynamics of sequence dependent base incorporation into DNA reveals novel long-distance genome organization (2012) (1)
When is a random graph projective (2006) (1)
Towards a Characterization of Universal Categories (2016) (1)
Density and Fractal Property of the Class of Oriented Trees (2019) (1)
On tension-continuous mapings (2006) (1)
Splitting finite antichains in the homomorphism order (2008) (1)
On Ramsey‐type positional games (2010) (1)
FINITE DUALITIES , IN PARTICULAR IN FULL HOMOMORPHISMS (2008) (1)
Decomposition horizons: from graph sparsity to model-theoretic dividing lines (2022) (1)
Introduction Ramsey Theory Old and New (1990) (1)
Z. Frolík and his winter schools (1992) (1)
Property Testing, Hyperfiniteness and Separators (2012) (1)
Book Review: Large networks and graph limits (2014) (1)
Minimal asymmetric hypergraphs (2021) (1)
Graph Colorings (Dagstuhl Seminar 03391) (2021) (0)
Fe b 20 06 On tension-continuous mappings (2006) (0)
Combinatorics, Geometry and Probability: A Ramsey-Type Theorem in the Plane (1997) (0)
A NEW COMBINATORIAL APPROACH TO THE CONSTRAINT SATISFACTION PROBLEM DICHOTOMY CLASSIFICATION (2007) (0)
Flow-continuous mappings - The influence of the group (2012) (0)
F\"uredi-Hajnal and Stanley-Wilf conjectures in higher dimensions (2021) (0)
Fragment of Aesthetic Processing (2010) (0)
THE STRUCTURE OF COMPOSITION (2004) (0)
Combinatorial number theory : proceedings of the "Integers Conference 2011", Carrollton, Georgia, USA, October 26-29, 2011 (2009) (0)
C O ] 24 F eb 2 00 6 On tension-continuous mappings (2020) (0)
A note on Random Homomorphism from ArbitraryGraphs to Z (2001) (0)
On the number of BB-flows of a graph (2014) (0)
Solutions and Hints for some of the Exercises (2012) (0)
Counting Homomorphisms to Sparse Graphs (2009) (0)
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687] (2013) (0)
Small Diameters of Duals (2007) (0)
Rainbow Ramsey Theory Veselin Jungić (2005) (0)
Interlacing adjoints on directed graphs (2009) (0)
8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (2012) (0)
Preface (2014) (0)
Graphs, morphisms and statistical physics : DIMACS Workshop Graphs, Morphisms and Statistical Physics, March 19-21, 2001, DIMACS Center (2004) (0)
Introduction (2007) (0)
Evaluation of total HCC lifespan , including both clinically evident and pre-clinical development , using combined Network Phenotyping Strategy and Fisher information analysis (2014) (0)
Self Generating Sets and Numeration Systems (2009) (0)
Adding Edges to Increase the Chromatic Number of a Graph (2016) (0)
Algorithms - ESA'99: 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999 Proceedings (1999) (0)
Gadget construction and structural convergence (2022) (0)
Finding Almost Squares III (2009) (0)
Foreword (2021) (0)
Preface (2016) (0)
Graph homomorphisms (2021) (0)
Note on strong product graph dimension (2022) (0)
Preface (2012) (0)
Preface (2012) (0)
Can dense graphs be "sparse"? (2012) (0)
Introduction (2009) (0)
Preface (2007) (0)
From $\chi$- to $\chi_p$-bounded classes (2020) (0)
Homomorphisms and Polynomial Invariants of Graphs 1 (2007) (0)
First-Order Constraint Satisfaction Problems, Limits and Homomorphism Dualities (2012) (0)
Ja n 20 08 Splitting finite antichains in the homomorphism order (2008) (0)
Back to Classes (2012) (0)
New Prize " Ems Monograph Award " by the Ems Publishing House European Mathematical Society Editor-in-chief Copy Editor (2013) (0)
Preface (2010) (0)
On Low Tree-Depth Decompositions (2015) (0)
Classes and Their Classification (2012) (0)
Validation of common typical time of disease duration for HCC patients using the Fisher information processing of tumor imaging results combined with network phenotyping strategy quantification of individual patient clinical profile patterns (2015) (0)
Foreword (2001) (0)
Ronald Lewis Graham (1935–2020) (2021) (0)
Validation of the Concept of a Common Typical Time of Disease Duration for Hepatocellular Carcinoma Patients Using the Fisher Information Processing of Tumor Imaging Results Combined With Network Phenotyping Strategy Quantification of Individual Patient Clinical Profile Patterns. (2015) (0)
DIMACS-DIMATIA International REU Research Experience for Undergraduates 2013 (2014) (0)
Statistics of orderings (2017) (0)
TESTING FOR THE EXISTENCE OF HOMOMORPHISMS (2004) (0)
Ramsey theorem for designs (2017) (0)
Riga $p$-point (1977) (0)
Nilpotent Families of Endomorphisms of (p(V)+, cup) (2002) (0)
Preface (2012) (0)
Preface (2015) (0)
Classes with Bounded Expansion – Examples (2012) (0)
Linear Equations Involving Iterates of σ (N) (2009) (0)
Preface (2009) (0)
PRODUCTS AND RETRACTS (2004) (0)
Preface (2007) (0)
Introduction (2011) (0)
The Structure of Asymmetric Graphs (1969) (0)
Foreword (2005) (0)
Preface (2011) (0)
Preface (2006) (0)
From χ- to χp-bounded classes (2021) (0)
Structural Limits and Approximations of Mappings (2015) (0)
Preface (2011) (0)
Ramsey Partial Orders from Acyclic Graphs (2017) (0)
Combinatorics of Ramanujan–Slater Type Identities (2009) (0)
Foreword (2003) (0)
Some recollections on early work with (2008) (0)
Preface: Volume 10 (2001) (0)
Subgraph Statistics for Geometric Graphs (2012) (0)
Approximations of Mappings (2018) (0)
Publications of Ron L. Graham (2007) (0)
An Extremal Problem on v-Partite Graphs (1983) (0)
Preface (2015) (0)
COLOURING—VARIATIONS ON A THEME (2004) (0)
Weighted graph homomorphisms and the Tutte polynomial (2007) (0)
Preface (2002) (0)
Combinatorial bounds on relational complexity (2013) (0)
Inside out, outside in (mathematics on a single snapshot) (2015) (0)
Some recollections on early work with Jan Pelant (2009) (0)
Heron Sequences and Their Modifications (2009) (0)
Sparsity - an Algorithmic Perspective (Invited Paper) (2018) (0)
Preface (2008) (0)
A Few Problems (2012) (0)
Vojtech Jarn! work incombin atorial optimization (2001) (0)
Entromics as thermodynamics of sequence dependent base incorporation into DNA reveals pervasive long distance genome organization (0)
Preface (2021) (0)
Restricted Homomorphism Dualities (2012) (0)
The Mathematics of László Lovász (2023) (0)
Preface (2020) (0)
On nowhere dense and somewhere dense-a graph trichotomy (2008) (0)
Preface (2017) (0)
Ramsey properties of edge-labelled graphs via completions (2019) (0)
High girth and extendability (1996) (0)
DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998) (2001) (0)
Maier Matrices Beyond Z (2009) (0)
Finite duality for some minor closed classes (2007) (0)
Preface (2008) (0)

This paper list is powered by the following services:

Other Resources About Jaroslav Nešetřil

What Schools Are Affiliated With Jaroslav Nešetřil?

Jaroslav Nešetřil is affiliated with the following schools:

Charles University

Image Attributions

Image Source for Jaroslav Nešetřil