Related papers: A counter-example to Baranyai's combinatorial char…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
In this paper, we give a necessary condition for a diagram to represent the trivial knot.
A sign pattern is a matrix whose entries belong to the set $\{+,-,0\}$. A sign pattern requires a unique inertia if every real matrix in its qualitative class has the same inertia. Symmetric tree sign patterns requiring a unique inertia has…
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and…
A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we show a fractional Helly theorem for convexity spaces with a bounded Radon number, answering a question of Kalai. As a consequence we…
We provide a combinatorial characterization of all testable properties of $k$-uniform hypergraphs ($k$-graphs for short). Here, a $k$-graph property $P$ is testable if there is a randomized algorithm which makes a bounded number of edge…
In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…
We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…
We show that for any fixed $\alpha>0$, cherry-quasirandom 3-graphs of positive density and sufficiently large order $n$ with minimum vertex degree $\alpha \binom n2$ have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and…
This paper provides a combinatorial characterisation for generic forced symmetric rigidity of bar-joint frameworks in the Euclidean plane that are symmetric with respect to the orientation-reversing wallpaper group…
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of minimally rigid periodic frameworks with…
We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we…
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
This article investigates the connectivity dimension of a graph. We introduce this concept in analogy to the metric dimension of a graph, providing a graph parameter that measures the heterogeneity of the connectivity structure of a graph.…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
Let $G$ be a graph on $n \ge 3$ vertices, whose adjacency matrix has eigenvalues $\lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_n$. The problem of bounding $\lambda_k$ in terms of $n$ was first proposed by Hong and was studied by Nikiforov,…
The stability number of a forbidden family measures how many different structures are needed to approximate all near-extremal constructions avoiding it. An infinite stability number means that no finite list of structures suffices. We…
We introduce and study local combinatorial conditions on a simplicial complex, implying Gromov hyperbolicity of its universal cover. We apply the theory to Thurston's problem on 5/6*-triangulations of 3-manifolds, providing a new proof and…