A. Pokrovskiy

activity

20102026

most citedDecompositions into spanning rainbow structures

32 citations · 98 across the 35 of their papers we have counts for

collaborators

Showing 2014Show all

5 papers · 1 filter

math.CO2014★ 10 cited

Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs

Ahmad Abu-Khazneh, Alexey Pokrovskiy

Ryser's Conjecture states that for any $r$ -partite $r$ -uniform hypergraph the vertex cover number is at most $r - 1$ times the matching number. This conjecture is only known to be tr…

math.CO2014

Graphs without proper subgraphs of minimum degree 3 and short cycles

Lothar Narins, Alexey Pokrovskiy, Tibor Szabó

We study graphs on $n$ vertices which have $2 n - 2$ edges and no proper induced subgraphs of minimum degree $3$ . Erdős, Faudree, Gyárfás, and Schelp conjectured that such graphs alwa…

math.CO2014

Edge disjoint Hamiltonian cycles in highly connected tournaments

Alexey Pokrovskiy

Thomassen conjectured that there is a function $f (k)$ such that every strongly $f (k)$ -connected tournament contains $k$ edge-disjoint Hamiltonian cycles. This conjecture was recent…

math.CO2014★ 4 cited

Highly linked tournaments

Alexey Pokrovskiy

A (possibly directed) graph is $k$ -linked if for any two disjoint sets of vertices ${x_{1}, \dots, x_{k}}$ and ${y_{1}, \dots, y_{k}}$ there are vertex disjoint paths $P_{1}, \dots, P_{k}$ …

math.CO2014

Identifying codes and searching with balls in graphs

Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3

Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…