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 2014 · math.COShow all

18 papers · 2 filters

math.CO2014★ 1 cited

The Disjoint Domination Game

Csilla Bujtás, Zsolt Tuza

We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker…

math.CO2014★ 1 cited

Induced cycles in triangle graphs

Aparna Lakshmanan S., Csilla Bujtás, Zsolt Tuza

The triangle graph of a graph $G$ , denoted by $T (G)$ , is the graph whose vertices represent the triangles ( $K_{3}$ subgraphs) of $G$ , and two vertices of $T (G)$ are adj…

math.CO2014★ 1 cited

An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes

Balázs Keszegh, Dömötör Pálvölgyi

The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract ver…

math.CO2014★ 9 cited

An improvement on the Delsarte-type LP-bound with application to MUBs

M. Matolcsi, M. Weiner

The linear programming (LP) bound of Delsarte can be applied to several problems in various branches of mathematics. We describe a general Fourier analytic method to get a slight i…

math.CO2014

On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs

Pablo Candela, Balázs Szegedy, Lluís Vena

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Král', Serra and the third author. To this end, we consider infinite…

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★ 27 cited

The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result

Jan Hladký, János Komlós, Diana Piguet +3

This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $α > 0$ there exists a number~ $k_{0}$ such th…

math.CO2014

The Density Turán problem

Péter Csikvári, Zoltán Lóránt Nagy

Let $H$ be a graph on $n$ vertices and let the blow-up graph $G [H]$ be defined as follows. We replace each vertex $v_{i}$ of $H$ by a cluster $A_{i}$ and connect some pairs of vertices…

math.CO2014

On the dimension of additive sets

P. Candela, H. A. Helfgott

We study the relations between several notions of dimension for an additive set, some of which are well-known and some of which are more recent, appearing for instance in work of S…

math.CO2014★ 1 cited

The automorphism group of a graphon

László Lovász, Balázs Szegedy

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we…

math.CO2014

Identifying codes and searching with balls in graphs

Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3

Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…

math.CO2014★ 11 cited

Multigraph limits, unbounded kernels, and Banach space decorated graphs

Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy

We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional ana…

math.CO2014★ 8 cited

The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs

Jan Hladky, Diana Piguet, Miklos Simonovits +2

Loebl, Komlós and Sós conjectured that every $n$ -vertex graph $G$ with at least $n /2$ vertices of degree at least $k$ contains each tree $T$ of order $k + 1$ as a subgraph. We give a…

math.CO2014

Supersaturation and stability for forbidden subposet problems

Balazs Patkos

We address a supersaturation problem in the context of forbidden subposets. A family $F$ of sets is said to contain the poset $P$ if there is an injection $i:P \rightarro…

math.CO2014

Cross-intersecting families of vectors

János Pach, Gábor Tardos

Given a sequence of positive integers $p = (p_{1}, ..., p_{n})$ , let $S_{p}$ denote the family of all sequences of positive integers $x = (x_{1}, ..., x_{n})$ such that $x_{i} \leq p_{i}$ for all…

math.CO2014

Union-intersecting set systems

Gyula O. H. Katona, Dániel T. Nagy

Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set s…

math.CO2014★ 1 cited

New sum-product estimates for real and complex numbers

Antal Balog, Oliver Roche-Newton

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results…

math.CO2014

Partitioning a graph into highly connected subgraphs

Valentin Borozan, Michael Ferrara, Shinya Fujita +4

Given $k \geq 1$ , a $k$ -proper partition of a graph $G$ is a partition $P$ of $V (G)$ such that each part $P$ of $P$ induces a $k$ -connected subgraph of $G$ . We…