Related papers: Grad and classes with bounded expansion III. restr…
Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…
Harm Derksen made a conjecture concerning degree bounds for the syzygies of rings of polynomial invariants in the non-modular case. We provide counterexamples to this conjecture, but also prove a slightly weakened version. We also prove…
We define duality triples and duality pairs in compactly generated triangulated categories and investigate their properties. This enables us to give an elementary way to determine whether a class is closed under pure subobjects, pure…
We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \textit{badness} of a given…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
A procedure for constructing bivariant theories by means of Grothendieck duality is developed. This produces, in particular, a bivariant theory of Hochschild (co)homology on the category of schemes that are flat, separated and essentially…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…
The aim of this paper is to introduce the notion of restricted Hom- Lie superalgebras. This class of algebras is a generalization of both restricted Hom-Lie algebras and restricted Lie superalgebras. In this paper, we present a way to…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
We prove a number of basic vanishing results for modified diagonal classes. We also obtain some sharp results for modified diagonals of curves and abelian varieties, and we prove a conjecture of O'Grady about modified diagonals on double…
This paper extends some results of Hatcher and Quinn beyond the metastable range. We give a bordism theoretic obstruction to deforming a map between manifolds simultaneously off of a collection of pairwise disjoint submanifolds under the…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
We solve the problem on flat extensions of a generic surface with boundary in Euclidean 3-space, relating it to the singularity theory of the envelope generated by the boundary. We give related results on Legendre surfaces with boundaries…
A main purpose of this paper is to prove that the class of finite dimensional algebras which verify Han's conjecture is closed under split bounded extensions.