Related papers: Degree Spectra of Relations on a Cone

We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…

We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by reordering. Using the previously…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

Although most of the real networks contain a mixture of directed and bidirectional (reciprocal) connections, the reciprocity $r$ has received little attention as a subject of theoretical understanding. We study the expected reciprocity of…

A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the node's neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks,…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…

For the notion of degree of categoricity, we study an analogous notion for punctual structures. We show that such notions coincide for non-$\Delta_{1}^{0}$-categorical injection structures, and construct an example of a…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the…

In Gao's previous work, the authors determined several graph degree conditions of a graph which admits fractional factor in particular settings. It was revealed that these degree conditions are tight if $b=f(x)=g(x)=a$ for all vertices $x$…

In their paper on multiplicity bounds (1998), Herzog and Srinivasan study the relationship between the graded Betti numbers of a homogeneous ideal I in a polynomial ring R and the degree of I. For certain classes of ideals, they prove a…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial $\Pi^0_1$ subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise…

We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…

Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion,…

We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions…

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…

Let $X \subset \mathbb{P}^n$ be a general Fano complete intersection of type $(d_1,\dots, d_k)$. If at least one $d_i$ is greater than $2$, we show that $X$ contains rational curves of degree $e \leq n$ with balanced normal bundle. If all…

For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine structure of graphs whose degree sequences contain either…