Search Results - "Nesetril, Jaroslav"

Minimal asymmetric hypergraphs by Jiang, Yiting, Nešetřil, Jaroslav

“…In this paper, we prove that for any k≥3, there exist infinitely many minimal asymmetric k-uniform hypergraphs. This is in a striking contrast to k=2, where it…”
Get full text

Modulo-counting first-order logic on bounded expansion classes by Nešetřil, Jaroslav, Ossona de Mendez, Patrice, Siebertz, Sebastian

“…We prove that, on bounded expansion classes, every first-order formula with modulo counting is equivalent, in a linear-time computable monadic expansion, to an…”
Get full text

In praise of homomorphisms by Hell, Pavol, Nešetřil, Jaroslav

“…In this brief paper we survey some of the recent development related to the notion of homomorphism. We briefly survey the many faceted development of the…”
Get full text

Grad and classes with bounded expansion I. Decompositions by Nešetřil, Jaroslav, Ossona de Mendez, Patrice

“…We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are…”
Get full text

Classes of graphs with low complexity: The case of classes with bounded linear rankwidth by Nešetřil, Jaroslav, Ossona de Mendez, Patrice, Rabinovich, Roman, Siebertz, Sebastian

“…Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths – a result that shows a…”
Get full text

From χ- to χ-bounded classes by Jiang, Yiting, Nešetřil, Jaroslav, Ossona de Mendez, Patrice

Get full text

Automorphism groups and Ramsey properties of sparse graphs by Evans, David M., Hubička, Jan, Nešetřil, Jaroslav

“…We study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todorčević correspondence. We investigate…”
Get full text

Metric spaces are Ramsey by Nešetřil, Jaroslav

“…We prove that the class of all ordered finite metric spaces is a Ramsey class. This solves a problem of Kechris, Pestov and Todorćevic…”
Get full text

On Low Tree-Depth Decompositions by Nešetřil, Jaroslav, Ossona de Mendez, Patrice

“…The theory of sparse structures usually uses tree like structures as building blocks. In the context of sparse/dense dichotomy this role is played by graphs…”
Get full text

Clustering Powers of Sparse Graphs by Nešetřil, Jaroslav, Ossona de Mendez, Patrice, Pilipczuk, Michał, Zhu, Xuding

“…We prove that if $G$ is a sparse graph — it belongs to a fixed class of bounded expansion $\mathcal{C}$ — and $d\in \mathbb{N}$ is fixed, then the $d$th power…”
Get full text

Characterisations and examples of graph classes with bounded expansion by Nešetřil, Jaroslav, Ossona de Mendez, Patrice, Wood, David R.

“…Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Nešetřil and Ossona de Mendez…”
Get full text

Grad and classes with bounded expansion II. Algorithmic aspects by Nešetřil, Jaroslav, Ossona de Mendez, Patrice

“…Classes of graphs with bounded expansion have been introduced in [J. Nešetřil, P. Ossona de Mendez, The grad of a graph and classes with bounded expansion, in:…”
Get full text

Ramsey Partial Orders from Acyclic Graphs by Nešetřil, Jaroslav, Rödl, Vojtěch

“…We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that the class of acyclic graphs has the Ramsey…”
Get full text

Colouring, constraint satisfaction, and complexity by Hell, Pavol, Nešetřil, Jaroslav

“…Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst…”
Get full text

Cluster analysis of local convergent sequences of structures by Nešetřil, Jaroslav, de Mendez, Patrice Ossona

“…The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer…”
Get full text

Polynomial graph invariants from homomorphism numbers by Garijo, Delia, Goodall, Andrew, Nešetřil, Jaroslav

“…We give a new method of generating strongly polynomial sequences of graphs, i.e., sequences (Hk) indexed by a tuple k=(k1,…,kh) of positive integers, with the…”
Get full text

Statistics of orderings by Nešetřil, Jaroslav, Rödl, Vojtěch

“…In this paper, we study a Ramsey type problems dealing with the number of ordered subgraphs present in an arbitrary ordering of a larger graph. Our first…”
Get full text

Invariant measures via inverse limits of finite structures by Ackerman, Nathanael, Freer, Cameron, Nešetřil, Jaroslav, Patel, Rehana

“…Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures,…”
Get full text

Fractal property of the graph homomorphism order by Fiala, Jiří, Hubička, Jan, Long, Yangjing, Nešetřil, Jaroslav

“…We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this…”
Get full text

Limits of mappings by Hosseini, Lucas, Nešetřil, Jaroslav, Ossona de Mendez, Patrice

“…In this paper we consider a simple algebraic structure — sets with a single endofunction. We shall see that from the point of view of structural limits, even…”
Get full text