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

F. Battiston36 · h 36
J. Kertész3 profiles27 · h 56
G. Íñiguez20 · h 21
K. Kaski17 · h 66
M. Karsai16 · h 35
Tiago P. Peixoto13 · h 29
R. Mantegna2 profiles12 · h 60
S. Miccichè10 · h 23
J'anos Kert'esz3 profiles9 · h 5
A. Barrat2 profiles8 · h 73
A. Barabási7 · h 150
Abhishek Methuku7 · h 17

collaborating institutions

HUN-REN Alfréd Rényi Institute of MathematicsHU42 papers
Aalto UniversityFI34 papers
Central European University - Budapest Campus34 papers
Complexity Science HubAT31 papers
Budapest University of Technology and EconomicsHU24 papers
Hungarian Academy of SciencesHU22 papers
Institute for Scientific InterchangeIT20 papers
University of PalermoIT17 papers
Northeastern UniversityUS16 papers
Universidad Nacional Autónoma de MéxicoMX15 papers
Centre National de la Recherche ScientifiqueFR14 papers
Eötvös Loránd UniversityHU12 papers

Showing 2014 · math.COShow all

2 papers · 2 filters

math.CO2014★ 21 cited

An improvement of the general bound on the largest family of subsets avoiding a subposet

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let $L a (n, P)$ be the maximum size of a family of subsets of $[n] = {1, 2, ..., n}$ not containing $P$ as a (weak) subposet, and let $h (P)$ be the length of a longest chain in $P$ .…

math.CO2014

Note on the Diameter of Path-Pairable Graphs

Gabor Meszaros

A graph on $2 k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have…