Related papers: Minimal rational graphs admitting a QHD smoothing
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
We show that a very general hypersurface of degree d at least 4 and dimension at most $(d+1)2^{d-4}$ over a field of characteristic different from 2 does not admit a decomposition of the diagonal; hence, it is neither stably nor retract…
The bipartite-hole-number of a graph $G$, denoted by $\widetilde{\alpha}(G)$, is the minimum number $k$ such that there exist positive integers $s$ and $t$ with $s+t=k+1$ with the property that for any two disjoint sets $A,B\subseteq V(G)$…
Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination. Given…
We formulate a very general conjecture relating the analytical invariants of a normal surface singularity to the Seiberg-Witten invariants of its link provided that the link is a rational homology sphere. As supporting evidence, we…
In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST)…
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…
Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…
We classify the resolution graphs of weighted homogeneous surface singularities which admit rational homology disk smoothings. The nonexistence of rational homology disk smoothings is shown by symplectic geometric methods, while the…
Let $G$ be a finite connected simple graph with a chosen orientation of its edges. For the edge potential $\psi(t)=\cosh t-1,$ we minimize $\sum_{e\in E^\to}\psi(z_e)$ over each affine class $\omega+dC^0(G)\subset C^1(G)$. The minimizer is…
Kriesel conjectured that every minimally $1$-tough graph has a vertex with degree precisely $2$. Katona and Varga (2018) proposed a generalized version of this conjecture which says that every minimally $t$-tough graph has a vertex with…
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…
We consider smoothings of a complex surface with singularities of class T and no nontrivial holomorphic vector field. Under an hypothesis of non degeneracy of the smoothing at each singular point, we prove that if the singular surface…
We give a $\delta$-constant criterion for equinormalizability of deformations of isolated (not necessarily reduced) curve singularities over smooth base spaces of dimension $\geq 1$. For one-parametric families of isolated curve…
A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…
Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted $k$-means algorithm.…
In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set $\mathcal H$. We…