A. Kabela

activity

20152024

most citedNo additional tournaments are quasirandom-forcing

10 citations · 14 across the 14 of their papers we have counts for

collaborators

20 papers

math.CO2024

Every $3$ -connected ${K_{1, 3}, Γ_{3}}$ -free graph is Hamilton-connected

Adam Kabela, Zdeněk Ryjáček, Mária Skyvová +1

We show that every $3$ -connected ${K_{1, 3}, Γ_{3}}$ -free graph is Hamilton-connected, where $Γ_{3}$ is the graph obtained by joining two vertex-disjoint triangles with a path of lengt…

math.CO2024

A closure for Hamilton-connectedness in ${K_{1, 3}, Γ_{3}}$ -free graphs

Adam Kabela, Zdeněk Ryjáček, Mária Skyvová +1

We introduce a closure technique for Hamilton-connectedness of ${K_{1, 3}, Γ_{3}}$ -free graphs, where $Γ_{3}$ is the graph obtained by joining two vertex-disjoint triangles with a path…

math.CO2023

Packing $T$ -connectors in graphs needs more connectivity

Roman Čada, Adam Kabela, Tomáš Kaiser +1

Strengthening the classical concept of Steiner trees, West and Wu [J. Combin. Theory Ser. B 102 (2012), 186--205] introduced the notion of a $T$ -connector in a graph $G$ with a set…

math.CO2022

The number of abundant elements in union-closed families without small sets

Adam Kabela, Michal Polák, Jakub Teska

We let $F$ be a finite family of sets closed under taking unions and $\emptyset \neq \in F$ , and call an element abundant if it belongs to more than half of the…

cs.DM2022

The smallest 5-chromatic tournament

Thomas Bellitto, Nicolas Bousquet, Adam Kabela +1

A coloring of a digraph is a partition of its vertex set such that each class induces a digraph with no directed cycles. A digraph is $k$ -chromatic if $k$ is the minimum number of…

math.CO2021

Density maximizers of layered permutations

Adam Kabela, Daniel Kral, Jonathan A. Noel +1

A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if $σ$ is a layered permutation, then the density of $σ$ in a permutation of order $n$ i…