Related papers: Erratum for Ricci-flat graphs with girth at least …
This paper is devoted to present two counterexamples to the theorem from \cite{MK} Maria R., Katherine T. M., Bernardo S. M., Extremal graphs with bounded vertex bipartiteness number, Linear Algebra Appl. 493 (2016) 28-36. Moreover, the…
As we showed in [3], a geometric inequality can be regarded as an optimization problem. In this paper we find another proof for a Chen's inequality,regarding the Ricci curvature [2] and we improve this inequality in the Lagrangian case.
In the work [$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24(3), 411--439, (1995)], Wen-Lian Hsu claims three results concerning the class of circular-arc graphs: -…
We amend the statement of point~(i) in Theorem~1.3 in arxiv:0901.1022 and supply the additional arguments and minor changes for the results that depend on it. We also seize the occasion and generalize to non-finitely generated lattices.
Inspired Yau's work (Comm. Anal. Geom., 1994), in this short note we provide a new version of Li-Yau gradient estimate for the linear heat equation, which generalizes some known results and gives new gradient estimates. Also we explain the…
Boris Shoikhet noticed that the proof of lemma 1 in section 2.3 of math.QA/0504420 contains an error. In this note I give a correct proof of this lemma which was suggested to me by Dmitry Tamarkin. The correction does not change the results…
We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…
Finite connected cubic symmetric graphs of girth 6 have been classified by K. Kutnar and D. Maru\v{s}i\v{c}, in particular, each of these graphs has an abelian automorphism group with two orbits on the vertex set. In this paper all cubic…
In this note a new measure of irregularity of a simple undirected graph $G$ is introduced. It is named the total irregularity of a graph and is defined as $\irr_t(G) = 1/2\sum_{u,v \in V(G)} |d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the…
Here (the last paper in a series of four) we end our presentation of the basics of a systematical approach to the differential geometry of a smooth manifold M (supporting a metric field g and a general connection del) which uses the…
The P\'osa-Seymour conjecture asserts that every graph on $n$ vertices with minimum degree at least $(1 - 1/(r+1))n$ contains the $r^{th}$ power of a Hamilton cycle. Koml\'os, S\'ark\"ozy and Szemer\'edi famously proved the conjecture for…
Morris and Saxton used the method of containers to bound the number of $n$-vertex graphs with $m$ edges containing no $\ell$-cycles, and hence graphs of girth more than $\ell$. We consider a generalization to $r$-uniform hypergraphs. The…
Given a graph $\Gamma$, the right-angled Artin group $A(\Gamma)$ is given by the presentation $\langle u \in V(\Gamma) \mid [u,v]=1, \ \{u,v\} \in E(\Gamma) \rangle$. The Embedding Problem in right-angled Artin groups asks, given two finite…
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually…
A subgroup of the automorphism group of a graph $\G$ is said to be {\em half-arc-transitive} on $\G$ if its action on $\G$ is transitive on the vertex set of $\G$ and on the edge set of $\G$ but not on the arc set of $\G$. Tetravalent…
We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-cut reductions. As a consequence, some hard…
The total irregularity of a graph $G$ is defined as $\irr_t(G)=1/2 \sum_{u,v \in V(G)}$ $|d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$. In this paper we give (sharp) upper bounds on the total irregularity of…
In 2015, Dankelmann and Bau proved that for every bridgeless graph $G$ of order $n$ and minimum degree $\delta$ there is an orientation of diameter at most $11\frac{n}{\delta+1}+9$. In 2016, Surmacs reduced this bound to…
An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…
We correct the statements of two theorems and two corollaries in our paper [On subgroup perfect codes in Cayley graphs, European J. Combin. 91 (2021) 103228]. Proofs of these theorems and three other results are given as well.