Related papers: On Maximal and Minimal Linear Matching Property

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…

In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…

For Ch\^atelet surfaces defined over number fields, we study two arithmetic properties, the Hasse principle and weak approximation, when passing to an extension of the base field. Generalizing a construction of Y. Liang, we show that for an…

In 2002, Kamae and Zamboni introduced maximal pattern complexity and determined that any aperiodic sequence must have maximal pattern complexity at least $2k$. In 2006, Kamae and Rao examined the maximal pattern complexity of sequences over…

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

In earlier work, it was established that for any finite field k, the free associative k-algebra on one generator x, denoted by k[x]_0, had infinitely many maximal T-spaces, but exactly two maximal $ideals (each of which is a maximal…

We prove an extension theorem for effective plt pairs $(X,S+B)$ of non-negative Kodaira dimension $\kappa (K_X+S+B)\geq 0$. The main new ingredient is a refinement of the Ohsawa-Takegoshi $L^2$ extension theorem involving singular hermitian…

A matching is a set of edges without common endpoint. It was recently shown that every 1-planar graph (i.e., a graph that can be drawn in the plane with at most one crossing per edge) that has minimum degree 3 has a matching of size at…

This paper, originally written in Hungarian by D\'{e}nes K\H{o}nig in 1931, proves that in a bipartite graph, the minimum vertex cover and the maximum matching have the same size. This statement is now known as K\H{o}nig's theorem. The…

In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

Gong, Wang and Yu introduced a maximal, or universal, version of the Roe C*-algebra associated to a metric space. We study the relationship between this maximal Roe algebra and the usual version, in both the uniform and non-uniform cases.…

Given a number field $K$ one associates to it the set $\Lambda_K$ of Dedekind zeta-functions of finite abelian extensions of $K$. In this short note we present a proof of the following Theorem: for any number field $K$ the set $\Lambda_K$…

We extend Michel's theorem on the geometry of symmetry breaking [L. Michel, {\it Comptes Rendus Acad. Sci. Paris} {\bf 272-A} (1971), 433-436] to the case of pure gauge theories, i.e. of gauge-invariant functionals defined on the space…

A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two new graph parameters that measure how far a graph is from…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and…

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

To what extent does the maximal subfield spectrum of a division algebra determine the isomorphism class of that algebra? It has been shown that over some fields a quaternion division algebra's isomorphism class is largely if not entirely…

Let $T$ be an o-minimal theory extending the theory of real closed ordered fields. An $H_T$-field is a model $K$ of $T$ equipped with a $T$-derivation such that the underlying ordered differential field of $K$ is an $H$-field. We study…

In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article aims to bring pleasure to the reader by giving short…