Central European University

output

20042026

most citedHistorical comparison of gender inequality in scientific careers across countries and disciplines

978 citations

researchers with a paper here

collaborating institutions

Showing 2017 · math.COShow all

6 papers · 2 filters

math.CO2017★ 1 cited

Generalized Turán problems for even cycles

Dániel Gerbner, Ervin Győri, Abhishek Methuku +1

Given a graph $H$ and a set of graphs $F$ , let $e x (n, H, F)$ denote the maximum possible number of copies of $H$ in an $F$ -free graph on $n$ vertices. We i…

math.CO2017★ 5 cited

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

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let $k \geq 2$ be an integer. We show that if $s = 2$ and $t \geq 2$ , or $s = t = 3$ , then the maximum possible number of edges in a $C_{2 k + 1}$ -free graph containing no induced copy…

math.CO2017★ 1 cited

Mobile vs. point guards

Ervin Győri, Tamás Róbert Mezei

We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using "rectangular vision". We prove a sharp bou…

math.CO2017★ 1 cited

Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands

Lucas Colucci, Péter L. Erdős, Ervin Győri +1

We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on t…

math.CO2017★ 1 cited

One more remark on the adjoint polynomial

Ferenc Bencs

The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_{k} (G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ di…

math.CO2017★ 3 cited

Terminal-Pairability in Complete Bipartite Graphs

Lucas Colucci, Péter L. Erdős, Ervin Győri +1

We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. W…