Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Özkahya, Lale"'
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations
Approximate solutions to various NP-hard combinatorial optimization problems have been found by learned heuristics using complex learning models. In particular, vertex (node) classification in graphs has been a helpful method towards finding the deci
Externí odkaz:
http://arxiv.org/abs/2210.16963
Complex networks representing social interactions, brain activities, molecular structures have been studied widely to be able to understand and predict their characteristics as graphs. Models and algorithms for these networks are used in real-life ap
Externí odkaz:
http://arxiv.org/abs/2210.11561
Autor:
Kırtışoğlu, Alaittin, Özkahya, Lale
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 well-known examples are star coloring and acyclic coloring of graphs (Gr\
Externí odkaz:
http://arxiv.org/abs/2012.04560
A $k$-motif (or graphlet) is a subgraph on $k$ nodes in a graph or network. Counting of motifs in complex networks has been a well-studied problem in network analysis of various real-word graphs arising from the study of social networks and bioinform
Externí odkaz:
http://arxiv.org/abs/2002.06957
Autor:
Özkahya, Lale, Person, Yury
Given graphs $G$ and $H$, we consider the problem of decomposing a properly edge-colored graph $G$ into few parts consisting of rainbow copies of $H$ and single edges. We establish a close relation to the previously studied problem of minimum $H$-dec
Externí odkaz:
http://arxiv.org/abs/1704.01000
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Füredi, Zoltán, Özkahya, Lale
We study the maximum number of hyperedges in a 3-uniform hypergraph on $n$ vertices that does not contain a Berge cycle of a given length $\ell$. In particular we prove that the upper bound for $C_{2k+1}$-free hypergraphs is of the order $O(k^2n^{1+1
Externí odkaz:
http://arxiv.org/abs/1412.8083
Autor:
Axenovich, Maria, Özkahya, Lale
For a vertex set $S\subseteq V(G)$ in a graph $G$, the {\em distance multiset}, $D(S)$, is the multiset of pairwise distances between vertices of $S$ in $G$. Two vertex sets are called {\em homometric} if their distance multisets are identical. For a
Externí odkaz:
http://arxiv.org/abs/1203.1158
Autor:
Stanton, Brendon, Özkahya, Lale
In this paper, we address a particular variation of the Tur\'an problem for the hypercube. Alon, Krech and Szab\'o (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, what is the size of a smallest set, S, of Q_l's so that every Q_d c
Externí odkaz:
http://arxiv.org/abs/1110.0224
Publikováno v:
Discrete Mathematics Vol 313, (2), (2013), 207 - 211
To study how balanced or unbalanced a maximal intersecting family $\mathcal{F}\subseteq \binom{[n]}{r}$ is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{\Delta(\mathcal{F})}{\delta(\mathcal{F})}$ of its maximum and minimum degree. We determin
Externí odkaz:
http://arxiv.org/abs/1109.1079