2 problems
Matching
Let be a graph. Call unavoidable if the cover graph of every poset of sufficiently large dimension contains as a minor. Kelly's construction refers to the family of pla…
Let be a poset, let be the cover graph of , and let be the incidence poset of . Cover-graph incidence-poset doubling conjecture. For every , there exists a…