10 citations · 20 across the 11 of their papers we have counts for
15 papers
Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
Christoph Brause, Jochen Harant, Florian Hörsch +1
Given a graph and sets and of non-negative integers, it is known that the decision problem whether contains a spanning tree $T…
Uniform Turán density of cycles
Matija Bucić, Jacob W. Cooper, Daniel Kráľ +2
In the early 1980s, Erdős and Sós initiated the study of the classical Turán problem with a uniformity condition: the uniform Turán density of a hypergraph is the infimum over…
Strong modeling limits of graphs with bounded tree-width
Andrzej Grzesik, Daniel Kráľ, Samuel Mohr
The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. Nešetřil and Ossona de Mendez [J. Symbolic Logic 84 (2019), 452-472]…
Circumference of essentially 4-connected planar triangulations
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A -connected graph is essentially -connected if, for any -cut of , at most one component of contains at least two vertices. We prove that ev…
Quasirandom Latin squares
Jacob W. Cooper, Daniel Kral, Ander Lamaison +1
We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is…
New bounds on domination and independence in graphs
Jochen Harant, Samuel Mohr
We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using…