857 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Hungarian Academy of SciencesHU402 papers
- Eötvös Loránd UniversityHU156 papers
- Budapest University of Technology and EconomicsHU58 papers
- Central European UniversityAT42 papers
- École Polytechnique Fédérale de LausanneCH31 papers
- Central European University - Budapest Campus24 papers
- University of PannoniaHU23 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- University College LondonGB20 papers
- University of SzegedHU20 papers
- University of Illinois Urbana-ChampaignUS18 papers
- Charles UniversityCZ15 papers
8 papers · 2 filters
Local chromatic number of quadrangulations of surfaces
Bojan Mohar, Gábor Simonyi, Gábor Tardos
The local chromatic number of a graph was introduced by Erdős et al. [4]. In [17] a connection to topological properties of (a box complex of) the graph was established and in [18]…
Completing Partial Packings of Bipartite Graphs
Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn
Given a bipartite graph and an integer , let be the smallest integer such that, any set of edge disjoint copies of on vertices, can be extended to an -de…
Gallai colorings and domination in multipartite digraphs
András Gyárfás, Gábor Simonyi, Ágnes Tóth
Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A_1,...,A_t of independent vertices. A set is called a domin…
The Local Lemma is asymptotically tight for SAT
Heidi Gebauer, Tibor Szabo, Gabor Tardos
The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptot…
Towards random uniform sampling of bipartite graphs with given degree sequence
Péter L. Erdös, Istán Miklós, Lajos Soukup
In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on vertices. We show that the mixing time of this Markov chain is bounded above…
On topological relaxations of chromatic conjectures
Gábor Simonyi, Ambrus Zsbán
There are several famous unsolved conjectures about the chromatic number that were relaxed and already proven to hold for the fractional chromatic number. We discuss similar relaxa…
Drawing Graphs with Orthogonal Crossings
Radoslav Fulek, Balázs Keszegh, Filip Morić
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertice…
Unique-maximum and conflict-free colorings for hypergraphs and tree graphs
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors…