Related papers: How is a graph like a manifold?
While the problem of determining the representation number of an arbitrary word-representable graph is NP-hard, this problem is open even for bipartite graphs. The representation numbers are known for certain bipartite graphs including all…
Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
This paper discusses the somewhat unintuitive conjecture that many Lorentz-invariant many-particle models can be reinterpreted to satisfy the gtr field equations. It is shown that a careful remapping of coordinates yields a non-trivial…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…
Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…
We identify and study a simple combinatorial problem that is derived from submodularity issues encountered in the theory of tangles of graphs and abstract separation systems.
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
Treating a conjecture, P^#P != NP, on the separation of complexity classes as an axiom, an implication is found in three manifold topology with little obvious connection to complexity theory. This is reminiscent of Harvey Friedman's work on…
The one-skeleton of a G-manifold M is the set of points p in M where $\dim G_p \geq \dim G -1$; and M is a GKM manifold if the dimension of this one-skeleton is 2. Goresky, Kottwitz and MacPherson show that for such a manifold this…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
The Graph Brain Project is an experiment in how the use of automated mathematical discovery software, databases, large collaboration, and systematic investigation provide a model for how mathematical research might proceed in the future.…
Two simple polytopes of dimension 3 having the identical bigraded Betti numbers but non-isomorphic Tor-algebras are presented. These polytopes provide two homotopically different moment-angle manifolds having the same bigraded Betti…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…