Related papers: Invariant graphs of rational maps
We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…
A graph $G$ is $H$-induced-saturated if $G$ is $H$-free but deleting any edge or adding any edge creates an induced copy of $H$. There are non-trivial graphs $H$, such as $P_4$, for which no finite $H$-induced-saturated graph $G$ exists. We…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
We give a classification of pairs (F, f) where F is a holomorphic foliation on a projective surface and f is a non-invertible dominant rational map preserving F. We prove that both the map and the foliation are integrable in a suitable…
We say that $f:[0,1]\to [0,1]$ is a {\it piecewise continuous interval map} if there exists a partition $0=x_0<x_1<\cdots<x_{d}<x_{d+1}=1$ of $[0,1]$ such that $f\vert_{(x_{i-1},x_i)}$ is continuous and the lateral limits $w_0^+=\lim_{x\to…
In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in…
We prove that if an analytic map $f:=(f_1,\ldots ,f_n):U\subset \mathbb{C}^n\rightarrow \mathbb{C}^n$ admits an algebraic addition theorem then there exists a meromorphic map $g:=(g_1,\ldots ,g_n):\mathbb{C}^n\rightarrow \mathbb{C}^n$…
For a graph $F$, let ${\rm EX}(n,F)$ be the set of $F$-free graphs of order $n$ with the maximum number of edges. The graph $F$ is called vertex-critical, if the deletion of its some vertex induces a graph with smaller chromatic number. For…
In their celebrated paper [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52], Erd\H{o}s and Hajnal asked the following: is it true, that for any finite graph H there exists a constant c(H) such that for any finite graph G, if G…
A Thurston map $f\colon (S^2, A) \to (S^2, A)$ with marking set $A$ induces a pullback relation on isotopy classes of Jordan curves in $(S^2, A)$. If every curve lands in a finite list of possible curve classes after iterating this pullback…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
We prove that for every complete multipartite graph $F$ there exist very dense graphs $G_n$ on $n$ vertices, namely with as many as ${n\choose 2}-cn$ edges for all $n$, for some constant $c=c(F)$, such that $G_n$ can be decomposed into…
Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Given a number field $\mathbb{K} \subset \mathbb{C}$ that is not contained in $\mathbb{R}$, we prove the existence of a dense set of entire maps $f \colon \mathbb{C} \rightarrow \mathbb{C}$ whose preperiodic points and multipliers all lie…
It is proved that for infinitely many positive integers n, there exists a circulant graph of order n whose Weisfeiler-Leman dimension is at least c\sqrt{log n} for some positive constant c not depending on n.
We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it…