Related papers: Completing graphs to metric spaces
We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.
We show that if we color the hyperedges of the complete $3$-uniform complete graph on $2n+\sqrt{18n+1}+2$ vertices with $n$ colors, then one of the color classes contains a loose path of length three.
We study valued fields equipped with an automorphism. We prove that all of them have an extension admitting an equivariant cross-section of the valuation. In residual characteristic zero, and in the presence of such a cross-section, we show…
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H} $ and the conflicts to…
When finding an original proof to a known result describing expansive mappings on compact metric spaces as surjective isometries, we reveal that relaxing the condition of compactness to total boundedness preserves the isometry property and…
An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that…
We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…
We give elementary applications of quasi-homomorphisms to growth problems in groups. A particular case concerns the number of torsion elements required to factorise a given element in the mapping class group of a surface.
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Under no additional assumptions, in this paper we construct a Ramsey expansion for every category of finite objects with finite small Ramsey degrees. Our construction is based on the relationship between small Ramsey degrees, weak…
Let $\mathrm{XY_{L,T}}$ denote the class of countably infinite $L$-structures that satisfy the axioms $T$ and in which all homomorphisms of type X (these could be homomorphisms, monomorphisms, or isomorphisms) between finite substructures…
This paper investigates self-maps T from X to X which satisfy a distance constraint in a metric space which mixed point-dependent non-expansive properties, or in particular contractive ones, and potentially expansive properties related to…
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected…
Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic…
An oriented compact closed manifold is called inflexible if the set of mapping degrees ranging over all continuous self-maps is finite. Inflexible manifolds have become of importance in the theory of functorial semi-norms on homology.…