Tel Hai Academic College

output

20002025

most citedThe quantum harmonic Otto cycle

378 citations

Showing math.COShow all

14 papers · 1 filter

math.CO2019★ 1 cited

Computing autotopism groups of partial Latin rectangles: a pilot study

Rebecca J. Stones, Raúl M. Falcón, Daniel Kotlar +1

Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (…

math.CO2016

On two extensions of equimatchable graphs

Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2

A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…

math.CO2016★ 3 cited

Degree conditions for matchability in $3$ -partite hypergraphs

Ron Aharoni, Eli Berger, Dani Kotlar +1

We study conjectures relating degree conditions in $3$ -partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particul…

math.CO2016★ 2 cited

Representation of large matchings in bipartite graphs

Ron Aharoni, Dani Kotlar, Ran Ziv

Let $f (n)$ be the smallest number such that every collection of $n$ matchings, each of size at least $f (n)$ , in a bipartite graph, has a full rainbow matching. Generalizing famous…

math.CO2015

Decomposition of bi-colored square arrays into balanced diagonals

Dani Kotlar, Ran Ziv

Given an $n \times n$ array $M$ ( $n \geq 7$ ), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of $M$ int…

math.CO2014

Distance magic labeling in complete 4-partite graphs

Dani Kotlar

Let $G$ be a complete $k$ -partite simple undirected graph with parts of sizes $p_{1} \leq p_{2} ... \leq p_{k}$ . Let $P_{j} = \sum_{i = 1}^{j} p_{i}$ for $j = 1, ..., k$ . It is conjectured that $G$ has dist…