Beka Ergemlidze

activity

20162021

most citedTurán number of an induced complete bipartite graph plus an odd cycle

5 citations · 11 across the 11 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

Transversal $C_{k}$ -factors in subgraphs of the balanced blow-up of $C_{k}$

Beka Ergemlidze, Theodore Molla

For a subgraph $G$ of the blow-up of a graph $F$ , we let $δ^{*} (G)$ be the smallest minimum degree over all of the bipartite subgraphs of $G$ induced by pairs of parts that correspon…

math.CO2021★ 2 cited

Minimizing the number of complete bipartite graphs in a $K_{s}$ -saturated graph

Beka Ergemlidze, Abhishek Methuku, Michael Tait +1

A graph $G$ is $F$ -saturated if it contains no copy of $F$ as a subgraph but the addition of any new edge to $G$ creates a copy of $F$ . We prove that for $s \geq 3$ and $t \geq 2$ ,…

Transversal Ck​-factors in subgraphs of the balanced blow-up of Ck​

Minimizing the number of complete bipartite graphs in a Ks​-saturated graph

Transversal $C_{k}$ -factors in subgraphs of the balanced blow-up of $C_{k}$

Minimizing the number of complete bipartite graphs in a $K_{s}$ -saturated graph