2 problems

Extension of the $(2,4)$ -Hall theorem to epsilon at most one third
arXiv@arxiv
Let $G$ be a bipartite graph with bipartition $(L,R)$ such that every vertex in $L$ has degree at most $3$ , no pair of degree $3$ vertices in $L$ has the same set of neighbours,…
Conjectureopengraph-theory hall-theorem matchings
1
Optimal epsilon bound for the $(2,4)$ -Hall theorems
arXiv@arxiv
Let $G$ be a bipartite graph with the hypotheses of Theorems 1 and 2: its bipartition is $(L,R)$ , every vertex in $L$ has degree at most $3$ , and, where required, no pair of degree…
Conjectureopengraph-theory hall-theorem matchings
0

Extension of the (2,4)(2,4)(2,4)-Hall theorem to epsilon at most one third