Related papers: Excluding Degree Sequences of Cycles

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…

We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…

Necessary condition to have Hamiltonian cycle in planar graph is given. Examples of regular planar graphs degree three without Hamiltonian cycle are built.

We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…

We prove that the hairy graph complex with the extra differential is almost acyclic. This justifies the construction of hairy graph cohomology classes by the waterfall mechanism. The main idea used in the paper is a new differential,…

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…

We make a systematic study of the focal surface of a congruence of lines in the projective space. Using differential techniques together with techniques from intersection theory, we reobtain in particular all the invariants of the focal…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

We study certain step functions whose nonnegativity is related to the integrality of sequences of ratios of factorial products. In particular, we obtain a lower bound for the mean square of such step functions which allows us to give a…

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…

We classify all Cohen-Macaulay chordal graphs. In particular. it is shown that a chordal graph is Cohen-Macaulay if and only if its unmixed.

The graphicality problem -- whether or not a sequence of integers can be used to create a simple graph -- is a key question in network theory and combinatorics, with many important practical applications. In this work, we study the…

Exceptional sequences are fundamental to investigate the derived categories of finite dimensional algebras. The aim of this note is to classify all the complete exceptional sequences over the path algebra of a Dynkin quiver of type $A_n$ in…

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…

A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path…