相关论文: Two Fra\"iss\'e-style theorems for homomorphism-ho…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

Two graphs $G_1,G_2$ are distinguished by the Weisfeiler--Leman isomorphism test if and only if there is a tree $T$ that has a different number of homomorphisms to $G_1$ and to $G_2$. There are two known proofs of this fact -- a logical…

The well-known Erd\H{o}s-Hajnal conjecture states that for any graph $F$, there exists $\epsilon>0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous set of size at least $n^{\epsilon}$. We consider…

We prove a conjecture of Migdail and Wehrli regarding the odd Khovanov cobordism maps associated to knotted spheres. Our key tool is Daemi's plane Floer homology, which we use in place of a Lee deformation. Continuing the analogy with Lee…

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

We extend M. Kontsevich's formality morphism to a homotopy braces morphism and to a homotopy Gerstenhaber morphism. We show that this morphism is homotopic to D. Tamarkin's formality morphism, obtained using formality of the little disks…

An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…

We use a link invariant defined by Cimasoni-Florens to compute \rho-invariants. This generalizes results of Cochran-Teichner and Friedl on knots to the setting of links. As an application, we prove with only twelve possible exceptions that…

We extend the Dikranjan-Uspenskij notions of c-compact and h-complete topological group to the morphism level, study the stability properties of the newly defined types of maps, such as closure under direct products, and compare them with…

A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $g\in G$ of the graph, where $G$ is a group of…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lov\'asz to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological…

We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…

We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph…

Let $S$ be a compact oriented surface. We construct homogeneous quasimorphisms on $Diff(S, area)$, on $Diff_0(S, area)$ and on $Ham(S)$ generalizing the constructions of Gambaudo-Ghys and Polterovich. We prove that there are infinitely many…

In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over $\sigma$-finite measure spaces has been introduced. In this paper, we…

In this short paper, we show that any Lam\'e system whose Dirichlet-to-Neumann map for the elastic wave equation agrees with the one arising from the homogeneous Lam\'e system must actually be homogeneous. We do not need to impose any…

In this paper, we develop the theory of Hom-Lie algebroids, Hom-Lie bialgebroids and Hom-Courant algebroids introduced by Cai, Liu and Sheng. Specifically, we introduce the notions of Hom-Poisson, Hom-Nijenhuis and Hom-Poisson-Nijenhuis…