We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (𝓓₁,𝓓₁)-partitionable planar graphs with respect to the property 𝓓₁ "to be a forest".
Guoliang Yu has introduced a property on discrete metric spaces and groups, which is a weak form of amenability and which has important applications to the Novikov conjecture and the coarse Baum–Connes conjecture. The aim of the present paper is to prove that property in particular examples, like spaces with subexponential growth, amalgamated free products of discrete groups having property A and HNN extensions of discrete groups having property A.
The repetition threshold introduced by Dejean and Brandenburg is the smallest real number α such that there exists an infinite word over a k-letter alphabet that avoids β-powers for all β > α. We extend this notion to colored graphs and obtain the value of the repetition thresholds of trees and “large enough” subdivisions of graphs for every alphabet size.
The repetition threshold introduced by Dejean and Brandenburg is the smallest real number α such that there exists an infinite word over a k-letter alphabet that avoids β-powers for all β > α. We extend this notion to colored graphs and obtain the value of the repetition thresholds of trees and “large enough” subdivisions of graphs for every alphabet size.
For any given positive integer k, and any set A of nonnegative integers, let denote the number of solutions of the equation n = a₁ + ka₂ with a₁,a₂ ∈ A. We prove that if k,l are multiplicatively independent integers, i.e., log k/log l is irrational, then there does not exist any set A ⊆ ℕ such that both and hold for all n ≥ n₀. We also pose a conjecture and two problems for further research.
The paper studies tolerances and congruences on anticommutative conservative groupoids. These groupoids can be assigned in a one-to-one way to undirected graphs.
The rational homology groups of packing complexes are important in algebraic geometry since they control the syzygies of line bundles on projective embeddings of products of projective spaces (Segre–Veronese varieties). These complexes are a common generalization of the multidimensional chessboard complexes and of the matching complexes of complete uniform hypergraphs, whose study has been a topic of interest in combinatorial topology. We prove that the multivariate version of representation stability,...