Showing 2019Show all
2 papers · 1 filter
cs.DM2019
Ear-Slicing for Matchings in Hypergraphs
András Sebő
We study when a given edge of a factor-critical graph is contained in a matching avoiding exactly one, pregiven vertex of the graph. We then apply the results to always partition t…
math.CO2019
Color-critical Graphs and Hereditary Hypergraphs
András Sebő
A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-…