12 citations · 28 across the 16 of their papers we have counts for
4 papers · 1 filter
Badges and rainbow matchings
Ron Aharoni, Joseph Briggs, Jinha Kim +1
Drisko proved that matchings of size in a bipartite graph have a rainbow matching of size . For general graphs it is conjectured that matchings suffice for this…
Cooperative conditions for the existence of rainbow matchings
Ron Aharoni, Joseph Briggs, Minho Cho +1
Let , and let be a family of non-empty sets of edges in a bipartite graph. If the union of every members of contains a matching of siz…
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
Ilkyoo Choi, Jinha Kim
We say a graph has a Hamiltonian path if it has a path containing all vertices of . For a graph , let denote the minimum degree sum of two nonadjacent vertices o…
Rainbow independent sets on dense graph classes
Jinha Kim, Minki Kim, O-joung Kwon
Given a family of independent sets in a graph, a rainbow independent set is an independent set such that there is an injection where fo…