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
18 papers · 2 filters
Multisets with few special directions and small weight codewords in Desarguesian planes
Sam Adriaensen, Tamás Szőnyi, Zsuzsa Weiner
In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even…
Rigidity and reconstruction in matroids of highly connected graphs
Dániel Garamvölgyi
A graph matroid family is a family of matroids defined on the edge set of each finite graph in a compatible and isomorphism-invariant way. We say…
Piercing intersecting convex sets
Imre Bárány, Travis Dillon, Dömötör Pálvölgyi +1
Assume two finite families and of convex sets in have the property that for every and $B\in \math…
The complexity of recognizing -free hypergraphs
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi +1
The study of geometric hypergraphs gave rise to the notion of -free hypergraphs. A hypergraph is called -free if there is an ordering of its vertices such…
Monochromatic graph decompositions inspired by anti-Ramsey theory and the odd-coloring problem
Yair Caro, Zsolt Tuza
We consider extremal edge-coloring problems inspired by the theory of anti-Ramsey / rainbow coloring, and further by odd-colorings and conflict-free colorings. Let be a graph,…
Proper edge colorings of planar graphs with rainbow -s
András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1
We call a proper edge coloring of a graph a B-coloring if every 4-cycle of is colored with four different colors. Let denote the smallest number of colors needed f…
Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma
Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh
In the past, analogues to Brooks' theorem have been found for various parameters of graph coloring for infinite locally finite connected graphs in ZFC. We prove these theorems are…
Packing Density of Sets With Only Two Nonmixed Gaps
Alexander Natalchenko, Arsenii Sagdeev
For a finite set of integers such that the first few gaps between its consecutive elements equal , while the remaining gaps equal , we study dense packings of its translates…
The diameter of random Schreier graphs
Daniele Dona, Luca Sabatini
We give a combinatorial proof of the following theorem. Let be any finite group acting transitively on a set of cardinality . If is a random set of size ,…
Diverse beam search to find densest-known planar unit distance graphs
Peter Engel, Owen Hammond-Lee, Yiheng Su +2
This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of vertices using computer search. An unsolved problem of Paul Erdős…
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For an ordered point set in a Euclidean space or, more generally, in an abstract metric space, the ordered Nearest Neighbor Graph is obtained by connecting each of the points to it…
A characterization of complex Hadamard matrices appearing in families of MUB triplets
Ákos K. Matszangosz, Ferenc Szöllősi
It is shown that a normalized complex Hadamard matrix of order having three distinct columns, each containing at least one entry necessarily belongs to the transposed Four…
Upper bounds for the list-distinguishing chromatic number
Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh
We prove analogs of Brooks' Theorem for the list-distinguishing chromatic number of different classes of simple finite connected graphs. Moreover, we determine two upper bounds for…
Fully graphic degree sequences and P-stable degree sequences
Péter L. Erdős, István Miklós, Lajos Soukup
The notion of -stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree seque…
Generalized saturation game
Balázs Patkós, Miloš Stojaković, Jelena Stratijev +1
We study the following game version of the generalized graph Turán problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the comple…
Progressions in Euclidean Ramsey theory
Jakob Führer, Géza Tóth
Conlon and Wu showed that there is a red/blue-coloring of that does not contain red collinear points separated by unit distance and blue collinear po…
General penny graphs are at most 43/18-dense
Arsenii Sagdeev
We prove that among points in the plane in general position, the shortest distance occurs at most times, improving upon the upper bound of obtained by Tóth in…
Highly connected orientations from edge-disjoint rigid subgraphs
Dániel Garamvölgyi, Tibor Jordán, Csaba Király +1
We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a -vertex-connected orientation. We prove th…