1 citations · 2 across the 7 of their papers we have counts for
13 papers · 1 filter
Strong Erdős-Hajnal properties in chordal graphs
Minho Cho, Andreas F. Holmsen, Jinha Kim +1
A graph class has the strong Erdős-Hajnal property (SEH-property) if there is a constant such that for every member of , eithe…
A system of disjoint representatives of line segments with given directions
Jinha Kim, Minki Kim, O-Joung Kwon
We prove that for all positive integers and , there exists an integer satisfying the following. If is a set of direction vectors in the plane and $\math…
Domination numbers and noncover complexes of hypergraphs
Jinha Kim, Minki Kim
Let be a hypergraph on a finite set . A {\em cover} of is a set of vertices that meets all edges of . If is not a cover of $\mathcal…
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…
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…