Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Jaroslav Nešetril"'
Autor:
Édouard Bonnet, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been further extend
Externí odkaz:
https://doaj.org/article/b3b721fcd37449f39e96cd175af28405
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stabl
Externí odkaz:
https://doaj.org/article/92b336c098dd46c09d3f88fc7717d317
Autor:
Jaroslav Nešetřil, Yared Nigussie
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable partial order can be embedded in $\mathcal{C}$. It was shown in [ZH] that the class $\mathcal{C_k}$ of $k$-colorable graphs, for any fixed $k≥3$, i
Externí odkaz:
https://doaj.org/article/f7525afac2c2417c8bc800fe2ade288e
Autor:
Bruce Landman, Melvyn B. Nathanson, Jaroslav Nešetril, Richard J. Nowakowski, Carl Pomerance, Aaron Robertson
This volume contains selected refereed papers based on lectures presented at the'Integers Conference 2011', an international conference in combinatorial number theory that was held in Carrollton, Georgia, United States in October 2011. This was the f
Autor:
Bruce Landman, Melvyn B. Nathanson, Jaroslav Nešetril, Richard J. Nowakowski, Carl Pomerance, Aaron Robertson
This volume contains selected refereed papers based on lectures presented at the ‘Integers Conference 2007', an international conference in combinatorial number theory that was held in Carrollton, Georgia in October 2007. The proceedings include co
This volume consists of twenty articles stemming from presentations given at the 2023 Integers Conference. They represent a variety of active areas of research in combinatorial number theory, including additive number theory, multiplicative number th
Over a career that spanned 60 years, Ronald L. Graham (known to all as Ron) made significant contributions to the fields of discrete mathematics, number theory, Ramsey theory, computational geometry, juggling and magical mathematics, and many more. R
Autor:
Richard J. Nowakowski, Bruce M. Landman, Florian Luca, Melvyn B. Nathanson, Jaroslav Nešetřil, Aaron Robertson
Elwyn Berlekamp, John Conway, and Richard Guy wrote ‘Winning Ways for your Mathematical Plays'and turned a recreational mathematics topic into a full mathematical fi eld. They combined set theory, combinatorics, codes, algorithms, and a smattering
This book collects the extended abstracts of the accepted contributions to EuroComb21. A similar book is published at every edition of EuroComb (every two years since 2001) collecting the most recent advances in combinatorics, graph theory, and relat
In this paper the authors introduce a general framework for the study of limits of relational structures and graphs in particular, which is based on a combination of model theory and (functional) analysis. The authors show how the various approaches