English
Related papers

Related papers: On the conjecture of bijection between perfect mat…

200 papers

A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…

Combinatorics · Mathematics 2022-02-03 Shmuel Onn

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

Combinatorics · Mathematics 2019-06-14 Israel Rocha

Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_1$ and $M_2$ such that $|M_1\cap X|\not\equiv |M_2\cap X| \pmod 2$.…

Combinatorics · Mathematics 2017-03-20 Jinghua He , Erling Wei , Dong Ye , Shaohui Zhai

We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number $q$ for which there is a guessing strategy on each vertex that only…

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…

Combinatorics · Mathematics 2022-08-17 Maximilian Gorsky , Raphael Steiner , Sebastian Wiederrecht

We prove that the number of partitions of the hypercube ${\bf Z}_q^n$ into $q^m$ subcubes of dimension $n-m$ each for fixed $q$, $m$ and growing $n$ is asymptotically equal to $n^{(q^m-1)/(q-1)}$. For the proof, we introduce the operation…

Combinatorics · Mathematics 2025-01-03 Yuriy Tarannikov

In this article we prove in main Theorem A that any infinity type real hyperplane arrangement $\mathcal{H}_n^m$ (Definition 2.11) with the associated normal system $\mathcal{N}$ (Definitions [2.2,2.4] can be represented isomorphically…

Combinatorics · Mathematics 2026-01-21 C. P. Anil Kumar

Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$…

Metric Geometry · Mathematics 2017-09-22 Sergii Myroshnychenko , Dmitry Ryabogin

Let $f\colon X\to Y$ be a perfect $n$-dimensional surjection of paracompact spaces with $Y$ being a $C$-space. We prove that, for any $m\geq n+1$, almost all (in the sense of Baire category) maps $g$ from $X$ into the $m$-dimensional cube…

General Topology · Mathematics 2007-05-23 H. Murat Tuncali , Vesko Valov

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_1$, $M_2$, and $M_3$. Given such a graph $G$ and any $a_1,a_2,a_3\in \mathbb{N}$ with $a_1+a_2+a_3\leq n-2$, we show there exists a matching $M$ of $G$ with…

Combinatorics · Mathematics 2023-06-02 Michael Anastos , David Fabian , Alp Müyesser , Tibor Szabó

We show that with high probability the random graph $G_{n, 1/2}$ has an induced subgraph of linear size, all of whose degrees are congruent to $r\pmod q$ for any fixed $r$ and $q\geq 2$. More generally, the same is true for any fixed…

Combinatorics · Mathematics 2021-07-16 Asaf Ferber , Liam Hardiman , Michael Krivelevich

We say $G$ is \emph{$(Q_n,Q_m)$-saturated} if it is a maximal $Q_m$-free subgraph of the $n$-dimensional hypercube $Q_n$. A graph, $G$, is said to be $(Q_n,Q_m)$-semi-saturated if it is a subgraph of $Q_n$ and adding any edge forms a new…

Combinatorics · Mathematics 2016-09-28 J. Robert Johnson , Trevor Pinto

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

We study generic conformally flat (local-)hypersurfaces in the Euclidean 4-space $\mathbb{R}^4$. Such a hypersurface $f$ has the dual (hypersurface) $f^*$ in $\mathbb{R}^4$, which is also generic and conformally flat. By repeating the…

Differential Geometry · Mathematics 2025-05-14 Yoshihiko Suyama

In 2016, Jang and Kim stated a conjecture about the norms of indecomposable integers in real quadratic number fields $\mathbb{Q} \left( \sqrt{D} \right)$ where $D>1$ is a squarefree integer. Their conjecture was later disproved by Kala for…

Number Theory · Mathematics 2021-06-07 Magdaléna Tinková , Paul Voutier

For any positive integer $k \geq 3,$ the sunlet graph of order $2k$, denoted by $L_{2k},$ is the graph obtained by adding a pendant edge to each vertex of a cycle of length $k.$ In this paper, we prove that the necessary and sufficient…

Combinatorics · Mathematics 2021-07-23 A. V. Sonawane

We prove that every proper edge-coloring of the $n$-dimensional hypercube $Q_n$ contains a rainbow copy of every tree $T$ on at most $n$ edges. This result is best possible, as $Q_n$ can be properly edge-colored using only $n$ colors while…

Combinatorics · Mathematics 2025-08-21 Nicholas Crawford , Maya Sankar , Carl Schildkraut , Sam Spiro

It is well known that in $n$-dimensional Euclidean space ($n\geq 2$) the classes of (diametrically) complete sets and of bodies of constant width coincide. Due to this, they both form a proper subfamily of the class of reduced bodies. For…

Metric Geometry · Mathematics 2018-02-27 Horst Martini , Senlin Wu

Suppose that h in F[x,y,z], char F=2, defines a nodal cubic. In earlier papers we made a precise conjecture as to the Hilbert-Kunz functions attached to the powers of h. Assuming this conjecture we showed that a class of characteristic 2…

Commutative Algebra · Mathematics 2009-08-10 Paul Monsky

A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…

Combinatorics · Mathematics 2025-10-15 Santhosh Raghul , Nishad Kothari