Related papers: How I got to like graph polynomials
Frieze patterns of numbers, introduced in the early 70's by Coxeter, are currently attracting much interest due to connections with the recent theory of cluster algebras. The present paper aims to review the original work of Coxeter and the…
Taking up a suggestion of David Gale from 1956, we generate sets of combinatorially isomorphic polytopes by choosing their Gale diagrams at random. We find that in high dimensions, and under suitable assumptions on the growth of the…
We prove several combinatorial results on path algebras over discrete structures related to directed graphs. These results are motivated by Morse theory on a manifold with boundary and, more generally, by Floer theory on a configuration…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
In this text I present some problems which led to the introduction of special kinds of graphs as tools for studying singular points of algebraic surfaces. I explain how such graphs were first described using words, and how several…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the chromatic polynomials of generalized vertex joins of trees,…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
This is an extended version of a talk given at the conference "Algebra and Topology in Interaction" on the occasion of the 70th Anniversary of D.B. Fuchs at UC Davis in September 2009. It is a brief survey of an area originated around 1995…
Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…
Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).
We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
This set of notes is based on a lecture I gave at "50 years of Finite Geometry | A conference on the occasion of Jef Thas's 70th birthday," in November 2014. It consists essentially of three parts: in a first part, I introduce some ideas…
In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
The purpose of this paper is to provide a new account of multiplicity for finite morphisms between smooth projective varieties. Traditionally, this has been defined using commutative algebra in terms of the length of integral ring…