97 problems

Associated Hermite matching-generating-function conjecture. The integral

Mkrtchyan–Petrosyan–Vardanyan conjecture. If

Let $M_s^r$ be a matching of size $s$ in an $r$-uniform hypergraph, and let $\operatorname{ex}_r(n,M_s^r)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergrap…

Let $n$ be even. In the rainbow perfect matching game $\mathcal{RP}_n$, played on $n/2$ copies of $K_n$, Maker wins by claiming a rainbow perfect matching; let $b_{\mathcal{RP}_n}$…

Let $H$ be an $r$-partite hypergraph containing at least one edge, and let $\nu(H)$ denote its matching number, the maximum number of pairwise disjoint edges. For a set $S$ of vert…

Rohatgi's conjecture. The stated subquadratic bound holds for almost every ordered matching of each fixed interval chromatic number.

Strong maximality and minimality conjecture. Every such hypergraph has a strongly maximal matching, a strongly minimal vertex cover, and a strongly minimal edge cover.

Let $k\geq 3$ and let $G$ be a $k$-critical graph. Let $\mu(G)$ denote the matching number and $\mu_f(G)$ the fractional matching number. Fractional matching gap conjecture. If $G$…

Interval-chromatic-two conjecture. There exists an $\epsilon>0$ such that, for every ordered matching $M^<$ on $n$ vertices with $\chi_<(M^<)=2$,

Let $Q_d$ be the $d$-dimensional hypercube, and let $\varphi$ be a partial $d$-edge coloring of $Q_d$. A color class is the set of edges receiving one fixed color, and an induced ma…

Let $S$ be an even set of points in the plane, and let $\mathcal M$ be a max-sum matching of $S$. Define $t(S)$ as the minimum, over points $y$ in the plane, of…

Let $S$ be an even set of points in the plane, and let $\{a_ib_i:i=1,\dots,n\}$ be a max-sum matching of $S$, where $|S|=2n$. A point $o$ is required to satisfy, for every matched…

Let $G$ be an $r$-regular graph with maximum degree $\Delta$ and edge-chromatic number $\chi'(G)=\Delta+1$. A maximum $\Delta$-colorable subgraph is a subgraph with as many edges a…

Let $G$ be a finite, simple, connected, $\Delta$-regular graph of order $n$, where $\Delta\geq 3$. The edge domination conjecture asserts that … Equality holds if and only if $G$ h…

Write $n=sm+c=s(m+1)-\ell$, and for $0\le k\le m$ define … and let $\mathcal P(m,s,\ell)$ be the shifted family $\{F\subseteq[n]\colon |F|+|F\cap[\ell-1]|\ge m+1\}$. Completeness c…

Let $n=s(m+1)-\ell$ and define … For $s\ge2$, $m\ge1$, and $1\le\ell\le\lceil s/2\rceil$, this family is a weighted construction with matching number less than $s$. Frankl–Kupavski…

Let $[n]=\{1,2,\ldots,n\}$, let $e(n,s)$ be the maximum of $|\mathcal F|$ over families $\mathcal F\subseteq 2^{[n]}$ with matching number $\nu(\mathcal F)<s$, and, for a weight fu…

Let $T$ be a tournament, namely an oriented graph in which every pair of distinct vertices is joined by exactly one directed arc. For a vertex $x$, let $N_T^+(x)$ and $N_T^{++}(x)$…

Let $D$ be an oriented graph. For a vertex $x$, let $N_D^+(x)$ and $N_D^{++}(x)$ denote its out-neighborhood and second out-neighborhood, respectively. A complete matching from $X$…

Type $(4,3)$ finite asymptotic separation index matching conjecture. If $\mathsf{asi}(G)<\infty$, then $G$ has a Borel matching covering $A$.

Finite asymptotic separation index matching conjecture. If the bipartition has combinatorial expansion and $\mathsf{asi}(G)<\infty$, then $G$ has a Borel matching covering $A$.

Erdős–Kleitman matching conjecture. Suppose that $s\ge 2$, $m\ge 1$, and $n=sm+s-\ell$ for some integer $0<\ell\leq\lceil s/2\rceil$. Then

Engbers–Erey's conjecture. The average size of maximal matchings, $avm(T)$, is uniquely minimized by

Let $G$ and $H$ be graphs, and let $\mathcal{R}(G,H)$ denote the family of Ramsey-minimal graphs for the pair $(G,H)$. A matching is a graph whose connected components are all isom…

Let $G$ and $H$ be graphs, and let $K_2$ denote the complete graph on two vertices. A pair $(G,H)$ is Ramsey-finite if it has only finitely many Ramsey-minimal graphs. Burr–Erdős–F…