Josef Cibulka

Josef Cibulka

Auto-generated profile, based on publicly available information

Josef Cibulka

Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Malostranské nám. 25 118 00 Praha 1 Czech Republic

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 January 2020 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
MBMartin Balko
Martin Balko
JCJosef Cibulka
Josef Cibulka
KKKarel Král
Karel Král
JKJan Kynčl
Jan Kynčl
An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph with $N$ vertices and with edges colored by two colors contains a monochromatic copy of $\mathcal{G}$. In contrast with the case of unordered graphs, we show that there are arbitrarily large ordered matchings $\mathcal{M}_n$ on $n$ vertices for which $\overline{R}(\mathcal{M}_n)$ is superpolynomial in $n$. This implies that ordered Ramsey numbers of the same graph can grow superpolynomially in the size of the graph in one ordering and remain linear in another ordering. We also prove that the ordered Ramsey number $\overline{R}(\mathcal{G})$ is polynomial in the number of vertices of $\mathcal{G}$ if the bandwidth of $\mathcal{G}$ is constant or if $\mathcal{G}$ is an ordered graph of constant degeneracy and constant interval chromatic number. The first result gives a positive answer to a question of Conlon, Fox, Lee, and Sudakov. For a few special classes of ordered paths, stars or matchings, we give asymptotically tight bounds on their ordered Ramsey numbers. For so-called monotone cycles we compute their ordered Ramsey numbers exactly. This result implies exact formulas for geometric Ramsey numbers of cycles introduced by Károlyi, Pach, Tóth, and Valtr.

1 October 2012 in Journal of Combinatorial Theory, Series A
Verified
Journal Article
Closed access
JCJosef Cibulka
Josef Cibulka
JKJan Kynčl
Jan Kynčl

6 March 2009 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
JCJosef Cibulka
Josef Cibulka

9 February 2018 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
MBMartin Balko
Martin Balko
JCJosef Cibulka
Josef Cibulka
PVPavel Valtr
Pavel Valtr

1 July 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
JCJosef Cibulka
Josef Cibulka
JKJan Kynčl
Jan Kynčl
VMViola Mészáros
Viola Mészáros
RSRudolf Stolař
Rudolf Stolař
PVPavel Valtr
Pavel Valtr

14 November 2014 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
JCJosef Cibulka
Josef Cibulka
PGPu Gao
Pu Gao
MKMarek Krčál
Marek Krčál
TVTomáš Valla
Tomáš Valla
PVPavel Valtr
Pavel Valtr