HUN-REN Alfréd Rényi Institute of Mathematics

output

19942026

most citedBrownian distance covariance

857 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

299 papers · 1 filter

math.CO2026

Bounds for B-coloring planar and outerplanar graphs

Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy

A proper coloring of the edges of a graph is one in which every $K_{1, 2}$ is totally multicolored. A B-coloring is a coloring of the edges of $G$ in which every $K_{1, 2}$ and every…

math.CO2025★ 3 cited

Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12

Péter Csikvári, Ivan Damnjanović, Marko Milošević +2

The energy $E (G)$ of a simple graph $G$ is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order $n \in N$ is any noncomp…

math.CO2025

Covering Complete Geometric Graphs by Monotone Paths

Adrian Dumitrescu, János Pach, Morteza Saghafian +1

Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_{n} [A]$ consists of all $(2 n)$ segments (edges) between the…

math.CO2025

Ordered Yao graphs: maximum degree, edge density, and clique numbers

Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2

For a positive integer $k$ and an ordered set of $n$ points in the plane, define its \textit{k-sector ordered Yao graphs} as follows. Divide the plane around each point into $k$ eq…

math.CO2025

Spectral algorithms in higher-order Fourier analysis

Pablo Candela, Diego González-Sánchez, Balázs Szegedy

Our goal is to provide simple and practical algorithms in higher-order Fourier analysis which are based on spectral decompositions of operators. We propose a general framework for…

math.CO2024

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…

math.CO2024★ 1 cited

Rigidity and reconstruction in matroids of highly connected graphs

Dániel Garamvölgyi

A graph matroid family $M$ is a family of matroids $M (G)$ defined on the edge set of each finite graph $G$ in a compatible and isomorphism-invariant way. We say…

math.CO2024

Piercing intersecting convex sets

Imre Bárány, Travis Dillon, Dömötör Pálvölgyi +1

Assume two finite families $A$ and $B$ of convex sets in $R^{3}$ have the property that $A \cap B \neq = \emptyset$ for every $A \in A$ and $B\in \math…

math.CO2024

The complexity of recognizing $A B A B$ -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 $A B A B$ -free hypergraphs. A hypergraph $H$ is called $A B A B$ -free if there is an ordering of its vertices such…

math.CO2024★ 1 cited

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 $G$ be a graph,…

math.CO2024★ 5 cited

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s

András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1

We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_{B} (G)$ denote the smallest number of colors needed f…

math.CO2024

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…

math.CO2024

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 $a$ , while the remaining gaps equal $b$ , we study dense packings of its translates…

math.CO2024

The diameter of random Schreier graphs

Daniele Dona, Luca Sabatini

We give a combinatorial proof of the following theorem. Let $G$ be any finite group acting transitively on a set of cardinality $n$ . If $S \subseteq G$ is a random set of size $k$ ,…

math.CO2024

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 $n$ vertices using computer search. An unsolved problem of Paul Erdős…

math.CO2024

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…

math.CO2024★ 1 cited

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 $6$ having three distinct columns, each containing at least one $- 1$ entry necessarily belongs to the transposed Four…

math.CO2024★ 1 cited

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…

math.CO2024★ 1 cited

Fully graphic degree sequences and P-stable degree sequences

Péter L. Erdős, István Miklós, Lajos Soukup

The notion of $P$ -stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree seque…

math.CO2024

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…

math.CO2024★ 1 cited

Progressions in Euclidean Ramsey theory

Jakob Führer, Géza Tóth

Conlon and Wu showed that there is a red/blue-coloring of $E^{n}$ that does not contain $3$ red collinear points separated by unit distance and $m = 1 0^{50}$ blue collinear po…

math.CO2024★ 1 cited

General penny graphs are at most 43/18-dense

Arsenii Sagdeev

We prove that among $n$ points in the plane in general position, the shortest distance occurs at most $43 n /18$ times, improving upon the upper bound of $17 n /7$ obtained by Tóth in…

math.CO2024★ 1 cited

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 $k$ -vertex-connected orientation. We prove th…

math.CO2023★ 1 cited

$H$ -percolation with a random $H$

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg

In $H$ -percolation, we start with an Erdős--Rényi graph $G_{n, p}$ and then iteratively add edges that complete copies of $H$ . The process percolates if all edges missing…

Bounds for B-coloring planar and outerplanar graphs

Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12

Covering Complete Geometric Graphs by Monotone Paths

Ordered Yao graphs: maximum degree, edge density, and clique numbers

Spectral algorithms in higher-order Fourier analysis

Multisets with few special directions and small weight codewords in Desarguesian planes

Rigidity and reconstruction in matroids of highly connected graphs

Piercing intersecting convex sets

The complexity of recognizing ABAB-free hypergraphs

Monochromatic graph decompositions inspired by anti-Ramsey theory and the odd-coloring problem

Proper edge colorings of planar graphs with rainbow C4​-s

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma

Packing Density of Sets With Only Two Nonmixed Gaps

The diameter of random Schreier graphs

Diverse beam search to find densest-known planar unit distance graphs

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs

A characterization of complex Hadamard matrices appearing in families of MUB triplets

Upper bounds for the list-distinguishing chromatic number

Fully graphic degree sequences and P-stable degree sequences

Generalized saturation game

Progressions in Euclidean Ramsey theory

General penny graphs are at most 43/18-dense

Highly connected orientations from edge-disjoint rigid subgraphs

H-percolation with a random H

The complexity of recognizing $A B A B$ -free hypergraphs

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s

$H$ -percolation with a random $H$