2024
Eur. J. Comb., March, 2024
Minimal asymmetric hypergraphs.
J. Comb. Theory B, January, 2024
Twin-width and permutations.
Log. Methods Comput. Sci., 2024
Special Issue dedicated to the memory of Pierre Rosenstiehl.
Eur. J. Comb., 2024
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas.
Discret. Math., 2024
2023
Note on strong product graph dimension.
Art Discret. Appl. Math., January, 2023
From <i>χ</i>- to <i>χ</i><sub><i>p</i></sub>-bounded classes.
J. Comb. Theory B, 2023
Ramsey theorem for trees with successor operation.
CoRR, 2023
Structural convergence and algebraic roots.
CoRR, 2023
Type-respecting amalgamation and big Ramsey degrees.
CoRR, 2023
The Mathematics of László Lovász.
CoRR, 2023
2022
Gadget construction and structural convergence.
CoRR, 2022
Modulo-Counting First-Order Logic on Bounded Expansion Classes.
CoRR, 2022
Decomposition horizons: from graph sparsity to model-theoretic dividing lines.
CoRR, 2022
On the first-order transduction quasiorder of hereditary classes of graphs.
CoRR, 2022
On the Homomorphism Order of Oriented Paths and Trees.
CoRR, 2022
Structural Properties of the First-Order Transduction Quasiorder.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022
2021
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth.
Eur. J. Comb., 2021
In praise of homomorphisms.
Comput. Sci. Rev., 2021
Big Ramsey degrees and forbidden cycles.
CoRR, 2021
Conant's generalised metric spaces are Ramsey.
Contributions Discret. Math., 2021
Rankwidth meets stability.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
First-Order Interpretations of Bounded Expansion Classes.
ACM Trans. Comput. Log., 2020
EATCS Distinguished Dissertation Award 2020 - Call for Nominations.
Bull. EATCS, 2020
Towards an arboretum of monadically stable classes of graphs.
CoRR, 2020
Regular partitions of gentle graphs.
CoRR, 2020
Clustering Powers of Sparse Graphs.
Electron. J. Comb., 2020
Linear rankwidth meets stability.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
Shrub-depth: Capturing Height of Dense Graphs.
Log. Methods Comput. Sci., 2019
Existence of Modeling Limits for sequences of Sparse Structures.
J. Symb. Log., 2019
EATCS Distinguished Dissertation Award 2019 - Call for Nominations.
Bull. EATCS, 2019
Density and Fractal Property of the Class of Oriented Trees.
CoRR, 2019
All those EPPA classes (Strengthenings of the Herwig-Lascar theorem).
CoRR, 2019
2018
Ramsey Partial Orders from Acyclic Graphs.
Order, 2018
A Ramsey class for Steiner systems.
J. Comb. Theory A, 2018
Graph-indexed random walks on pseudotrees.
Electron. Notes Discret. Math., 2018
EPPA for two-graphs and antipodal metric spaces.
CoRR, 2018
A combinatorial proof of the extension property for partial isometries.
CoRR, 2018
Automorphism groups and Ramsey properties of sparse graphs.
CoRR, 2018
Bowtie-free graphs have a Ramsey lift.
Adv. Appl. Math., 2018
Sparsity - an Algorithmic Perspective (Invited Paper).
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Cluster analysis of local convergent sequences of structures.
Random Struct. Algorithms, 2017
Ramsey theorem for designs.
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
Fractal property of the graph homomorphism order.
Eur. J. Comb., 2017
Ramsey Classes with Closure Operations (Selected Combinatorial Applications).
CoRR, 2017
Ramsey properties and extending partial automorphisms for classes of finite structures.
CoRR, 2017
2016
Homomorphism and Embedding Universal Structures for Restricted Classes.
J. Multiple Valued Log. Soft Comput., 2016
Strongly polynomial sequences as interpretations.
J. Appl. Log., 2016
First-order limits, an analytical perspective.
Eur. J. Comb., 2016
Invariant measures via inverse limits of finite structures.
Eur. J. Comb., 2016
Polynomial graph invariants from homomorphism numbers.
Discret. Math., 2016
A distributed low tree-depth decomposition algorithm for bounded expansion classes.
Distributed Comput., 2016
Adding Edges to Increase the Chromatic Number of a Graph.
Comb. Probab. Comput., 2016
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms).
CoRR, 2016
Modeling Limits in Hereditary Classes: Reduction and Application to Trees.
Electron. J. Comb., 2016
2015
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems.
J. Graph Theory, 2015
On Low Tree-Depth Decompositions.
Graphs Comb., 2015
Electron. Notes Discret. Math., 2015
Structural Limits and Approximations of Mappings.
Electron. Notes Discret. Math., 2015
Ramsey classes with forbidden homomorphisms and a closure.
Electron. Notes Discret. Math., 2015
Universal Structures with Forbidden Homomorphisms.
Proceedings of the Logic Without Borders, 2015
2014
Colouring edges with many colours in cycles.
J. Comb. Theory B, 2014
Flow-continuous mappings - The influence of the group.
Eur. J. Comb., 2014
On the number of <i>B</i>B-flows of a graph.
Eur. J. Comb., 2014
On first-order definable colorings.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014
2013
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687].
Eur. J. Comb., 2013
Complexities of relational structures.
CoRR, 2013
Ramsey Theory in the Work of Paul Erdős.
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
Finite dualities and map-critical graphs on a fixed surface.
J. Comb. Theory B, 2012
Tension continuous maps - Their structure and applications.
Eur. J. Comb., 2012
Characterisations and examples of graph classes with bounded expansion.
Eur. J. Comb., 2012
When Trees Grow Low: Shrubs and Fast MSO1.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Sparsity - Graphs, Structures, and Algorithms.
Algorithms and combinatorics 28, Springer, ISBN: 978-3-642-27874-7, 2012
2011
Electron. Notes Discret. Math., 2011
Electron. Notes Discret. Math., 2011
How many F's are there in G?
Eur. J. Comb., 2011
Distinguishing graphs by their left and right homomorphism profiles.
Eur. J. Comb., 2011
Interleaved adjoints of directed graphs.
Eur. J. Comb., 2011
2010
Dualities and Dual Pairs in Heyting Algebras.
Order, 2010
First order properties on nowhere dense structures.
J. Symb. Log., 2010
On Ramsey-type positional games.
J. Graph Theory, 2010
Path homomorphisms, graph colorings, and boolean matrices.
J. Graph Theory, 2010
A combinatorial constraint satisfaction problem dichotomy classification conjecture.
Eur. J. Comb., 2010
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms.
Eur. J. Comb., 2010
Dualities in full homomorphisms.
Eur. J. Comb., 2010
2009
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009).
Electron. Notes Discret. Math., 2009
Counting Homomorphisms to Sparse Graphs.
Electron. Notes Discret. Math., 2009
Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness".
Electron. Notes Discret. Math., 2009
Fraternal augmentations, arrangeability and linear Ramsey numbers.
Eur. J. Comb., 2009
A surprising permanence of old motivations (a not-so-rigid story).
Discret. Math., 2009
Some Examples of Universal and Generic Partial Orders.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009
Invitation to Discrete Mathematics (2. ed.).
Oxford University Press, ISBN: 978-0-19-857042-4, 2009
2008
Structural Properties of Sparse Graphs.
Electron. Notes Discret. Math., 2008
A dualistic approach to bounding the chromatic number of a graph.
Eur. J. Comb., 2008
On tension-continuous mappings.
Eur. J. Comb., 2008
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities.
Eur. J. Comb., 2008
Grad and classes with bounded expansion II. Algorithmic aspects.
Eur. J. Comb., 2008
Grad and classes with bounded expansion I. Decompositions.
Eur. J. Comb., 2008
Forbidden lifts (NP and CSP for combinatorialists).
Eur. J. Comb., 2008
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures.
Eur. J. Comb., 2008
Colouring, constraint satisfaction, and complexity.
Comput. Sci. Rev., 2008
Many Facets of Dualities.
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
Small Diameters of Duals.
SIAM J. Discret. Math., 2007
Density of universal classes of series-parallel graphs.
J. Graph Theory, 2007
On the Density of Trigraph Homomorphisms.
Graphs Comb., 2007
Finite duality for some minor closed classes.
Electron. Notes Discret. Math., 2007
Fraternal Augmentations of graphs, Coloration and Minors.
Electron. Notes Discret. Math., 2007
Electron. Notes Discret. Math., 2007
NP for Combinatorialists.
Electron. Notes Discret. Math., 2007
Homomorphisms and Polynomial Invariants of Graphs.
Electron. Notes Discret. Math., 2007
On Finite Maximal Antichains in the Homomorphism Order.
Electron. Notes Discret. Math., 2007
Metric spaces are Ramsey.
Eur. J. Comb., 2007
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
NP by Means of Lifts and Shadows.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
2006
A Probabilistic Approach to the Dichotomy Problem.
SIAM J. Comput., 2006
Constraint Satisfaction with Countable Homogeneous Templates.
J. Log. Comput., 2006
Minimal universal and dense minor closed classes.
Eur. J. Comb., 2006
Tree-depth, subgraph coloring and homomorphism bounds.
Eur. J. Comb., 2006
Homomorphism bounded classes of graphs.
Eur. J. Comb., 2006
When is a random graph projective?
Eur. J. Comb., 2006
Antisymmetric flows in matroids.
Eur. J. Comb., 2006
Homomorphism-Homogeneous Relational Structures.
Comb. Probab. Comput., 2006
Ramsey classes of topological and metric spaces.
Ann. Pure Appl. Log., 2006
Generalised Dualities and Finite Maximal Antichains.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
Linear time low tree-width partitions and algorithmic consequences.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
Theor. Comput. Sci., 2005
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality.
SIAM J. Discret. Math., 2005
Finite Paths are Universal.
Order, 2005
The acyclic edge chromatic number of a random <i>d</i>-regular graph is <i>d</i> + 1.
J. Graph Theory, 2005
The Grad of a Graph and Classes with Bounded Expansion.
Electron. Notes Discret. Math., 2005
Universal partial order represented by means of oriented trees and other simple graphs.
Eur. J. Comb., 2005
Ramsey Classes and Homogeneous Structures.
Comb. Probab. Comput., 2005
2004
Note on projective graphs.
J. Graph Theory, 2004
On sparse graphs with given colorings and homomorphisms.
J. Comb. Theory B, 2004
Antisymmetric flows and edge-connectivity.
Discret. Math., 2004
Graphs and homomorphisms.
Oxford lecture series in mathematics and its applications 28, Oxford University Press, ISBN: 978-0-19-852817-3, 2004
2003
On the order of countable graphs.
Eur. J. Comb., 2003
On maximal finite antichains in the homomorphism order of directed graphs.
Discuss. Math. Graph Theory, 2003
A note on random homomorphism from arbitrary graphs to Z.
Discret. Math., 2003
Rainbow Arithmetic Progressions and Anti-Ramsey Results.
Comb. Probab. Comput., 2003
2002
Theor. Comput. Sci., 2002
Theor. Comput. Sci., 2002
A rigid graph for every set.
J. Graph Theory, 2002
Art of Graph Drawing and Art.
J. Graph Algorithms Appl., 2002
Nilpotent Families of Endomorphisms of (p(V)+, cup).
J. Comb. Theory B, 2002
Partitions of Graphs into Cographs.
Electron. Notes Discret. Math., 2002
Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions.
Eur. J. Comb., 2002
Universal H-colorable graphs without a given configuration.
Discret. Math., 2002
H-Colorings of Large Degree Graphs.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations.
Proceedings of the Algorithms, 2002
Diskrete Mathematik - eine Entdeckungsreise (korrigierter Nachdruck).
Springer-Lehrbuch, Springer, ISBN: 978-3-540-42386-7, 2002
2001
Electron. Notes Discret. Math., 2001
A note on Random Homomorphism from ArbitraryGraphs to Z.
Electron. Notes Discret. Math., 2001
Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory.
Discret. Math., 2001
Construction of sparse graphs with prescribed circular colorings.
Discret. Math., 2001
I. Schur, C.E. Shannon and Ramsey Numbers, a short story.
Discret. Math., 2001
A note on homomorphism-independent families.
Discret. Math., 2001
Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history.
Discret. Math., 2001
On oriented path double covers.
Discret. Math., 2001
Colorings and homomorphisms of degenerate and bounded degree graphs.
Discret. Math., 2001
Vojtech Jarni'k's work in combinatorial optimization.
Discret. Math., 2001
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).
Discret. Math., 2001
On the Oriented Game Chromatic Number.
Electron. J. Comb., 2001
Towards an Aesthetic Invariant for Graph Drawing.
Proceedings of the Graph Drawing, 9th International Symposium, 2001
Counting List Homomorphisms and Graphs with Bounded Degrees.
Proceedings of the Graphs, 2001
2000
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations).
J. Comb. Theory B, 2000
Colored Homomorphisms of Colored Mixed Graphs.
J. Comb. Theory B, 2000
Electron. Notes Discret. Math., 2000
The complexity of <i>H</i>-colouring of bounded degree graphs.
Discret. Math., 2000
1999
On the maximum average degree and the oriented chromatic number of a graph.
Discret. Math., 1999
Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number.
Comb. Probab. Comput., 1999
Proceedings of the Graph Drawing, 7th International Symposium, 1999
1998
A Ramsey Property of Order Types.
J. Comb. Theory A, 1998
Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth.
Eur. J. Comb., 1998
On universal graphs for planar oriented graphs of a given girth.
Discret. Math., 1998
Invitation to discrete mathematics.
Oxford University Press, ISBN: 978-0-19-850207-4, 1998
1997
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder.
J. Algorithms, 1997
Colorings and girth of oriented planar graphs.
Discret. Math., 1997
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP).
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997
Spectra, graphs, and proteins. Towards understanding of protein folding.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
Induced monochromatic subconfigurations.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1996
On bounded treewidth duality of graphs.
J. Graph Theory, 1996
High girth and extendability.
Discret. Math., 1996
Complexity of Tree Homomorphisms.
Discret. Appl. Math., 1996
1994
on ordered Graphs and Graph orderings.
Discret. Appl. Math., 1994
A Ramsey-type Theorem in the Plane.
Comb. Probab. Comput., 1994
1992
Minimal asymmetric graphs of induced length 4.
Graphs Comb., 1992
On Ramsey graphs without bipartite subgraphs.
Discret. Math., 1992
Z. Frolík and his winter schools.
Discret. Math., 1992
Simple tournaments and sharply transitive groups.
Discret. Math., 1992
1991
Noncrossing Subgraphs in Topological Layouts.
SIAM J. Discret. Math., 1991
Extendability, Dimensions, and Diagrams of Cycle Orders.
SIAM J. Discret. Math., 1991
Images of Rigid Digraphs.
Eur. J. Comb., 1991
Reorientations of covering graphs.
Discret. Math., 1991
1990
On Locally Presented Posets.
Theor. Comput. Sci., 1990
On the complexity of <i>H</i>-coloring.
J. Comb. Theory B, 1990
1989
Chromatically optimal rigid graphs.
J. Comb. Theory B, 1989
For graphs there are only four types of hereditary Ramsey classes.
J. Comb. Theory B, 1989
The partite construction and ramsey set systems.
Discret. Math., 1989
1988
Epidemiography II. Games with a dozing yet winning player.
J. Comb. Theory A, 1988
The chromatic connectivity of graphs.
Graphs Comb., 1988
Linearity and Unprovability of Set Union Problem Strategies
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Postorder Hierarchy for Path Compressions and Set Union.
Proceedings of the Machines, 1988
1987
On the Maximum Weight Clique Problem.
Math. Oper. Res., 1987
Local <i>k</i>-colorings of graphs and hypergraphs.
J. Comb. Theory B, 1987
Efficient Representation of Taxonomies.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987
Posets, Boolean Representations and Quick Path Searching.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Large minimal sets which force long arithmetic progressions.
J. Comb. Theory A, 1986
Finite union theorem with restrictions.
Graphs Comb., 1986
On sets of integers with the Schur property.
Graphs Comb., 1986
1985
Canonizing Ordering Theorems for Hales Jewett Structures.
J. Comb. Theory A, 1985
Two remarks on Ramsey's theorem.
Discret. Math., 1985
On the use of senders in generalized ramsey theory for graphs.
Discret. Math., 1985
1984
Some Nonstandard Ramsey Like Applications.
Theor. Comput. Sci., 1984
1983
Ramsey Classes of Set Systems.
J. Comb. Theory A, 1983
Another Proof of the Folkman-Rado-Sanders Theorem.
J. Comb. Theory A, 1983
An Extremal Problem on v-Partite Graphs.
Eur. J. Comb., 1983
1982
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs.
Eur. J. Comb., 1982
1981
Amalgamation of matroids and its applications.
J. Comb. Theory B, 1981
Quotients of rigid graphs.
J. Comb. Theory B, 1981
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction.
Comb., 1981
Representations of Graphs by Means of Products and Their Complexity.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981
1980
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.
Theor. Comput. Sci., 1980
On a product dimension of graphs.
J. Comb. Theory B, 1980
1979
A short proof of the existence of highly chromatic hypergraphs without short cycles.
J. Comb. Theory B, 1979
1978
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph.
Discret. Math., 1978
On classes of relations and graphs determined by subobjects and factorobjects.
Discret. Math., 1978
1977
Partitions of Finite Relational and Set Systems.
J. Comb. Theory A, 1977
A Dushnik - Miller Type Dimension of Graphs and its Complexity.
Proceedings of the Fundamentals of Computation Theory, 1977
1975
Either tournaments or algebras?
Discret. Math., 1975
1971
Homomorphisms of derivative graphs.
Discret. Math., 1971
