相关论文: How is a graph like a manifold?

In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…

A manifold $M^n$ inherits a labeled $n$-dimensional graph $\widetilde{M}[G^L]$ structure consisting of its charts. This structure enables one to characterize fundamental groups of manifolds, classify those of locally compact manifolds with…

Manin's conjecture predicts an asymptotic formula for the number of rational points of bounded height on a smooth projective variety in terms of its global geometric invariants. The strongest form of the conjecture implies certain…

A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…

In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…

For a compact and convex window, Mecke described a process of tessellations which arise from cell divisions in discrete time. At each time step, one of the existing cells is selected according to an equally-likely law. Independently, a line…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…

In 1994, it was conjectured by Fan and Raspaud that every simple bridgeless cubic graph has three perfect matchings whose intersection is empty. In this paper we answer a question recently proposed by Mkrtchyan and Vardanyan, by giving an…

We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…

In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical physics. We apply some…

A theory of complexity for pairs (M,G) with M an arbitrary closed 3-manifold and G a 3-valent graph in M was introduced by the first two named authors, extending the original notion due to Matveev. The complexity c is known to be always…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

The Multiplicity Conjecture is a deep problem relating the multiplicity (or degree) of a Cohen-Macaulay standard graded algebra with certain extremal graded Betti numbers in its minimal free resolution. In the case of level algebras of…

In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…

Mazur, Kapranov, Reznikov, and others developed ``Arithmetic Topology,'' a theory describing some surprising analogies between 3-dimensional topology and number theory, which can be summarized by saying that knots are like prime numbers. We…

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…

Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms…