Shimon Kogan

activity

20172026

most citedTarget Set Selection for Conservative Populations

3 citations · 8 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020

A note on a Caro-Wei bound for the bipartite independence number in graphs

Shimon Kogan

A bi-hole of size $t$ in a bipartite graph $G$ is a copy of $K_{t, t}$ in the bipartite complement of $G$ . Given an $n \times n$ bipartite graph $G$ , let $β (G)$ be the largest $k$ f…

math.CO2019★ 1 cited

New results on large induced forests in graphs

Shimon Kogan

For a graph $G$ , let $a (G)$ denote the maximum size of a subset of vertices that induces a forest. We prove the following. 1. Let $G$ be a graph of order $n$ , maximum degree $Δ > 0$ …

math.CO2017

On the Profile of Multiplicities of Complete Subgraphs

Uriel Feige, Anne Kenyon, Shimon Kogan

Let $G$ be a $2$ -coloring of a complete graph on $n$ vertices, for sufficiently large $n$ . We prove that $G$ contains at least $n^{(\frac{1}{4} - o (1)) l o g n}$ monochromatic comple…