◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Kotlar

24 papers hereh-index 12663 citations50 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author6
  • first author5
  • middle author9
  • last author4

Across the 24 of 24 papers where every author was matched, so the position is known.

fields
  • math.CO24

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedDegree conditions for matchability in 3-partite hypergraphs

3 citations · 10 across the 21 of their papers we have counts for

collaborators
Showing 2015Show all

2 papers · 1 filter

math.CO2015

Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv

Ron Aharoni, Dani Kotlar, Ran Ziv

Drisko \cite{drisko} proved (essentially) that every family of 2n−1 matchings of size n in a bipartite graph possesses a partial rainbow matching of size n. In \cite{bgs} thi…

math.CO2015

Decomposition of bi-colored square arrays into balanced diagonals

Dani Kotlar, Ran Ziv

Given an n×n array M (n≥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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.