10 citations · 20 across the 11 of their papers we have counts for
5 papers · 2 filters
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…
Random perturbation of sparse graphs
Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge +2
In the model of randomly perturbed graphs we consider the union of a deterministic graph with minimum degree and the binomial random graph . T…
Rooted Minors and Locally Spanning Subgraphs
Thomas Böhme, Jochen Harant, Matthias Kriesell +2
Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present…
A Construction of Uniquely Colourable Graphs with Equal Colour Class Sizes
Samuel Mohr
A uniquely -colourable graph is a graph with exactly one partition of the vertex set into at most colour classes. Here, we investigate some constructions of uniquely -col…