3 citations · 3 across the 7 of their papers we have counts for
7 papers · 1 filter
Star Coloring of Hypergraphs
Lale Özkahya, Polat Sariyerli
We study a generalization of the star coloring problem on hypergraphs. For a family of connected subhypergraphs , we define an -coloring of a hypergraph a…
Coloring Grids Avoiding Bicolored Paths
Derman Keskinkilic, Lale Ozkahya
The star chromatic number on a graph is the minimum number of colors in a proper vertex coloring forbidding any with two colors (bicolored). This problem was introduced by Gr…
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
Alaittin Kırtışoğlu, Lale Özkahya
The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of a fixed family of subgraphs has been widely studied. Most wel…
Minimum Rainbow -Decompositions of Graphs
Lale Özkahya, Yury Person
Given graphs and , we consider the problem of decomposing a properly edge-colored graph into few parts consisting of rainbow copies of and single edges. We establish…
On homometric sets in graphs
Maria Axenovich, Lale Özkahya
For a vertex set in a graph , the {\em distance multiset}, , is the multiset of pairwise distances between vertices of in . Two vertex sets are ca…
On a covering problem in the hypercube
Brendon Stanton, Lale Özkahya
In this paper, we address a particular variation of the Turán problem for the hypercube. Alon, Krech and Szabó (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, w…
On the ratio of maximum and minimum degree in maximal intersecting families
Zoltán Loránt Nagy, Lale Özkahya, Balázs Patkós +1
To study how balanced or unbalanced a maximal intersecting family is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{Δ(\mathcal{F})}{δ(\…