Related papers: The compression body graph has infinite diameter
We show that the independence number of a countably infinite HH-homogeneous graph that does not contain the Rado graph as a spanning subgraph is finite and present a classification of MB-homogeneous graphs up to bimorphism-equivalence as a…
A consequence of Ore's classic theorem characterizing the maximal graphs with given order and diameter is a determination of the largest such graphs. We give a very short and simple proof of this smaller result, based on a well-known…
This is an expository paper (in Spanish) describing the origin and history of the Hirsch Conjecture about the maximum diameter of graphs of polytopes, and the ideas that led to the counter-example to it recently announced by the author in…
The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification…
We prove that Cheng maximal diameter theorem for hypergraphs with positive coarse Ricci curvature.
For any g>1 we construct a graph G_g in S^3 whose exterior M_g supports a complete finite-volume hyperbolic structure with one toric cusp and a connected geodesic boundary of genus g. We compute the canonical decomposition and the isometry…
We conjecture that finite graphs with positive Cheeger constant admit a spanning subgraph with positive Cheeger constant and girth proportional to the diameter. We prove this conjecture for regular expander graphs with large expansion. Our…
We construct a new infinite-dimensional family of homogeneous quasimorphisms on the group of Hamiltonian diffeomorphisms of the two-sphere. Moreover, for any constant $K$ less than the total area of the sphere, we produce unbounded…
The structure of the character degree graphs $\Delta(G)$, i.e. the prime graphs on the set $\mathrm{cd}(G)$ of the irreducible character degrees of a finite group $G$, such that $G$ is solvable and $\Delta(G)$ has diameter three, remains an…
We give a combinatorial proof of the following theorem. Let $G$ be any finite group acting transitively on a set of cardinality $n$. If $S \subseteq G$ is a random set of size $k$, with $k \geq (\log n)^{1+\varepsilon}$ for some…
We show that the size of maximum cut in a planar graph with $m$ edges is at least $2m/3$. We also show that maximal planar graphs saturate this bound.
We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…
Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$
A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an…
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
We prove that the diameter of the commuting graph of the full ma- trix ring over the real numbers is at most five. This answers, in the affir- mative, a conjecture proposed by Akbari-Mohammadian-radjavi-Raja, for the special case of the…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
It is proved that the square of the Sorgenfrey line has infinite covering dimension.
We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…
We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of…