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

16 papers · 2 filters

math.CO2019★ 2 cited

Sticky matroids and convolution

Laszlo Csirmaz

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convo…

math.CO2019

Remarks on the distribution of colors in Gallai colorings

Joseph Feffer, Yaoying Fu, Jun Yan

A Gallai coloring of a complete graph $K_{n}$ is an edge coloring without triangles colored with three different colors. A sequence $e_{1} \geq \dots \geq e_{k}$ of positive integers is an…

math.CO2019★ 1 cited

The domination number of the graph defined by two levels of the $n$ -cube, II

József Balogh, Gyula O. H. Katona, William Linz +1

Consider all $k$ -element subsets and $ℓ$ -element subsets $(k > ℓ)$ of an $n$ -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell…

math.CO2019★ 3 cited

Half-graphs, other non-stable degree sequences, and the switch Markov chain

Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain con…

math.CO2019

On $L$ -close Sperner systems

Daniel Nagy, Balazs Patkos

For a set $L$ of positive integers, a set system $F \subseteq 2^{[n]}$ is said to be $L$ -close Sperner, if for any pair $F, G$ of distinct sets in $F$ the skew d…

math.CO2019★ 2 cited

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Joshua Erde, Pascal Gollin, Atilla Joó +2

We show that if a graph admits a packing and a covering both consisting of $λ$ many spanning trees, where $λ$ is some infinite cardinal, then the graph also admits a decomposition…

math.CO2019★ 8 cited

Edge-ordered Ramsey numbers

Martin Balko, Máté Vizer

We introduce and study a variant of Ramsey numbers for edge-ordered graphs, that is, graphs with linearly ordered sets of edges. The edge-ordered Ramsey number $\overline{R}_e(\mat…

math.CO2019★ 1 cited

Inequalities for doubly nonnegative functions

Alexander Sidorenko

Let $g$ be a bounded symmetric measurable nonnegative function on $[0, 1]^{2}$ , and $∥ g ∥ = \int_{[0, 1]^{2}} g (x, y) d x d y$ . For a graph $G$ with vertices $\{v_1,v_…

math.CO2019★ 2 cited

New bounds on even cycle creating Hamiltonian paths using expander graphs

Gergely Harcos, Daniel Soltész

We say that two graphs on the same vertex set are $G$ -creating if their union (the union of their edges) contains $G$ as a subgraph. Let $H_{n} (G)$ be the maximum number of pairwise…

math.CO2019★ 19 cited

The mixing time of the switch Markov chains: a unified approach

Péter L. Erdős, Catherine Greenhill, Tamás Róbert Mezei +3

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results w…

math.CO2019★ 5 cited

Edge colorings of graphs without monochromatic stars

Lucas Colucci, Ervin Győri, Abhishek Methuku

In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph…

math.CO2019★ 7 cited

Distribution of colors in Gallai colorings

András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós +1

A Gallai coloring is an edge coloring that avoids triangles colored with three different colors. Given integers $e_{1} \geq e_{2} \geq \dots \geq e_{k}$ with $\sum_{i = 1}^{k} e_{i} = (2 n)$ …

math.CO2019★ 1 cited

On L(2,1)-labelings of oriented graphs

Lucas Colucci, Ervin Győri

We extend a result of Griggs and Yeh about the maximum possible value of the L(2,1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the pr…

math.CO2019

On specific factors in graphs

Csilla Bujtás, Stanislav Jendrol, Zsolt Tuza

It is well known that if $G = (V, E)$ } is a multigraph and $X \subset V$ is a subset of even order, then $G$ contains a spanning forest $H$ such that each vertex from $X$ has an odd…

math.CO2019★ 4 cited

Realization of digraphs in Abelian groups and its consequences

Sylwia Cichacz, Zsolt Tuza

Let $G$ be a directed graph with no component of orderless than~ $3$ , and let $Γ$ be a finite Abelian group such that $∣Γ∣ \geq 4∣ V (G) ∣$ or if $|V(\…

math.CO2019★ 36 cited

A class of phylogenetic networks reconstructable from ancestral profiles

Peter L. Erdos, Charles Semple, Mike Steel

Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set $X$ of sampled species. In contrast to phylogenetic trees which show only speci…

Sticky matroids and convolution

Remarks on the distribution of colors in Gallai colorings

The domination number of the graph defined by two levels of the n-cube, II

Half-graphs, other non-stable degree sequences, and the switch Markov chain

On L-close Sperner systems

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Edge-ordered Ramsey numbers

Inequalities for doubly nonnegative functions

New bounds on even cycle creating Hamiltonian paths using expander graphs

The mixing time of the switch Markov chains: a unified approach

Edge colorings of graphs without monochromatic stars

Distribution of colors in Gallai colorings

On L(2,1)-labelings of oriented graphs

On specific factors in graphs

Realization of digraphs in Abelian groups and its consequences

A class of phylogenetic networks reconstructable from ancestral profiles

The domination number of the graph defined by two levels of the $n$ -cube, II

On $L$ -close Sperner systems