Related papers: Two New Gestures on Peirce's Continuum and the Exi…
Hypergraphs naturally represent higher-order interactions, which persistently appear from social interactions to neural networks and other natural systems. Although their importance is well recognized, a theoretical framework to describe…
We identify a class of hyperbolic transcendental entire maps and we prove that some of its elements generate a class of potentials for which exhibit a conformal and invariant probability Gibbs measure. The methods and techniques from the…
We identify a natural analytic continuation in four dimensions from Minkowski signature to a signature with two time-like momentum components. For two, three and four-point diagrams at fixed external momenta, this continuation can be…
Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…
In new progress on conjectures of Stein, and Addario-Berry, Havet, Linhares Sales, Reed and Thomass\'e, we prove that every oriented graph with all in- and out-degrees greater than 5k/8 contains an alternating path of length k. This…
We establish new lower bounds for the convergence radius of the Mayer series and the Virial series of a continuous particle system interacting via a stable and tempered pair potential. Our bounds considerably improve those given by Penrose…
Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs that arise from 2-weight codes. One of these new graphs is…
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…
This work presents ideas for the determination of complete experiments using graphs, which are based on a recently published, modified form of Moravcsik's theorem. The lucid representation of complete experiments in terms of graphs, which…
We show that there exists an outerplanar graph on $O(n^{c})$ vertices for $c = \log_2(3+\sqrt{10}) \approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This extends a result of Chung and Graham from 1983 who showed that…
Most instruments - formalisms, concepts, and metrics - for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ranging from the fine-grain dynamics of interactions (which recently…
In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…
Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved…
A new complete invariant for acyclic graphs is presented
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…
We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum…