Related papers: Simplices and spectra of graphs

This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…

Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

Over a global field any finite number of central simple algebras of exponent dividing $m$ is split by a common cyclic field extension of degree $m$. We show that the same property holds for function fields of two-dimensional excellent…

Let $G$ be a graph with $n$ vertices, with independence number $\alpha$, and with with no $K_{t+1}$-minor for some $t\geq5$. It is proved that $(2\alpha-1)(2t-5)\geq2n-5$.

We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…

We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.

We prove that every $n$-vertex graph with at least $\binom{n}{2} - (n - 4)$ edges has a fractional triangle decomposition, for $n \ge 7$. This is a key ingredient in our proof, given in a companion paper, that every $n$-vertex $2$-coloured…

Some arithmetic properties of spectral curves are discussed: the spectral curve, for example, of a charge $n\ge2$ Euclidean BPS monopole is not defined over $\overline{\mathbb{Q}}$ if smooth.

We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity)…

In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…

We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…

In this paper we consider the discrete Laplacian acting on 1-forms and we study its spectrum relative to the spectrum of the 0-form Laplacian. We show that the non zero spectrum can coincide for these Laplacians with the same nature. We…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…