相关论文: Determining Genus From Sandpile Torsor Algorithms
Species survival in the $(3, 1)$ May-Leonard system is determined by the mobility, with a critical mobility threshold between long-term coexistence and extinction. We show experimentally that the critical mobility threshold is determined by…
In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…
We propose bipartite analogues of comparability and cocomparability graphs. Surprizingly, the two classes coincide. We call these bipartite graphs cocomparability bigraphs. We characterize cocomparability bigraphs in terms of vertex…
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented…
We compute the treewidth of a family of graphs we refer to as the glued grids, consisting of the stacked prism graphs and the toroidal grids. Our main technique is constructing strict brambles of large orders. We discuss connections to…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
An explicit expression is obtained for the generating series for the number of ramified coverings of the sphere by the double torus, with elementary branch points and prescribed ramification type over infinity. Thus we are able to prove a…
We investigate how exchange-graph techniques can be used to study the topology of strata of meromorphic quadratic differentials. The exchange graph provides natural generators for the fundamental group. By extending the combinatorics of…
A topological index reflects the physical, chemical and structural properties of a molecule, and its study has an important role in molecular topology, chemical graph theory and mathematical chemistry. It is a natural problem to…
Tractors and Twistors bundles both provide natural conformally covariant calculi on $4D$-Riemannian manifolds. They have different origins but are closely related, and usually constructed bottom-up through prolongation of defining…
We study standard monomial bases for Richardson varieties inside the flag variety. In general, writing down a standard monomial basis for a Richardson variety can be challenging, as it involves computing so-called defining chains or key…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…
We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much larger than that of the genes. The key distinction between…
For each three-bridge link of a certain form, we construct a taut Seifert surface for the link and establish whether the link is fibred. Using this, we also give the genus and fibredness of satellite knots whose pattern is constructed from…
We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…