Related papers: Expanders and Property A
In this paper, we define bi-asymptotically $c$-expansive maps on metric spaces and study its relationship with other variants of expansivity such as bi-asymptotically expansive maps and $N$-expansive maps. We also provide an example to…
We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…
We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new…
We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any ($2K_{2}$, claw)-free graph with $\alpha(G) \geq 3$ is a split graph. Also, we apply it to characterize any pseudo-split graph.…
For a positive integer $k$, a graph property $\mathcal{H}$, and a graph parameter $\mathcal{P}$, let $\operatorname{ex}_{\mathcal{P}}(n, \mathcal{H}; \delta \geq k)$ denote the maximum value of $\mathcal{P}$ over all $n$-vertex graphs with…
A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…
We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…
In this paper we show that there does not exist a strongly regular graph with parameters $(1911,270,105,27)$.
This paper defines and describes a few (related) notions of shrinking target property. We show that simultaneous expanding circle maps have a certain shrinking target property, but that circle homeomorphisms and isometries of complete,…
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…
In this paper, we give a study of the $\mathbb{C}[\partial]$-split extending structures problem for associative conformal algebras. Using the unified product as a tool, which includes interesting products such as bicrossed product, cocycle…
We give a partial account of some problems concerning cohomological invariants and metric properties of complex non-K\"ahler manifolds.
Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
We prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This implies that there exist cubic graphs of arbitrarily high girth with no homomorphisms to the cycle of size 7.
We discuss the internal structure of graph products of right LCM semigroups and prove that there is an abundance of examples without property (AR). Thereby we provide the first examples of right LCM semigroups lacking this seemingly common…
Let $M$ be a closed smooth manifold and let $f:M\to M$ be a diffeomorphism. $C^1$-generically, a continuum-wise expansive satisfies Axiom A without cycles. Moreover, there is a partially hyperbolic diffeomorphism $f$ such that it is not…
This two-page note gives a non-computational derivation of the dual Steenrod algebra as the automorphisms of the formal additive group. Instead of relying on computational tools like spectral sequences and Steenrod operations, the argument…
We study the coefficients in the expansion of Jack polynomials in terms of power sums. We express them as polynomials in the free cumulants of the transition measure of an anisotropic Young diagram. We conjecture that such polynomials have…
In this note, we provide a proof of a technical result of Erd\H{o}s and Hajnal about the existence of disjoint type graphs with no odd cycles. We also prove that this result is sharp in a certain sense.