Related papers: Excluding Degree Sequences of Cycles
We give a simple geometric interpretation of an algebraic construction of Wenger that yields $n$-vertex graphs with no cycle of length $4$, $6$ or $10$ and close to the maximum number of edges.
This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…
In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d_1,...,d_n) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case (i.e. where the average degree is rather small). Our general…
Let $\mathcal{X}$ be a projective algebraic curve and denote by $\mathcal{X}^{'}$ its strict dual curve. The map $\gamma:\mathcal{X} \longrightarrow \mathcal{X}^{'}$ is called (strict) Gauss map of $\mathcal{X}$. In this manuscript, we…
Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the…
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…
We introduce the concept of degree to classify the periods in the sense of Kontsevich. Using this notion we give some new understanding of some problems in transcendental number theory.
The paper investigates recoverability of sequences from their periodic subsequences and offers some modification of the approach suggested in papers arXiv:1605.00414 and arXiv:1803.02233. It is shown that there exists a class of sequences…
The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it sequentially adds new random edges so that the degree of each…
Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…
A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is a $2$-connected cubic graph, then any longest cycle must have a chord. He also showed that in…
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…
We introduce the degree filtration on the discrete cubical chain complex of a graph, defined in terms of the maximal injective dimension of the facets of singular $n$-cubes, and study the degree spectral sequence which arises from this…
We answer an open question in the theory of degrees of infinite sequences with respect to transducibility by finite-state transducers. An initial study of this partial order of degrees was carried out in (Endrullis, Hendriks, Klop, 2011),…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…