3 papers
math.CO2026
Tree-independence number of -free graphs with no large bicliques
Václav Blažej, J. Pascal Gollin, Tomáš Hons +5
The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bo…
math.CO2026
Unavoidable subgraphs in digraphs with large out-degrees
Tomáš Hons, Tereza Klimošová, Gaurav Kucheriya +3
We ask the question, which oriented trees must be contained as subgraphs in every finite directed graph of sufficiently large minimum out-degree. We formulate the following sim…
math.CO2025
A Polynomial Ramsey Statement for Bounded VC-dimension
Tomáš Hons
A theorem by Ding, Oporowski, Oxley, and Vertigan states that every sufficiently large bipartite graph without twins contains a matching, co-matching, or half-graph of any given si…