Abhishek Methuku

activity

20142026

most citedAn Erdős-Gallai type theorem for uniform hypergraphs

39 citations · 146 across the 54 of their papers we have counts for

collaborators

Showing 2019Show all

8 papers · 1 filter

math.CO2019★ 2 cited

Generalized rainbow Turán problems

Dániel Gerbner, Tamás Mészáros, Abhishek Methuku +1

Alon and Shikhelman initiated the systematic study of the following generalized Turán problem: for fixed graphs $H$ and $F$ and an integer $n$ , what is the maximum number of copies…

math.CO2019★ 6 cited

Set systems related to a house allocation problem

Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +4

We are given a set $A$ of buyers, a set $B$ of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping $τ$ from $A…

math.CO2019

Bipartite Turán problems for ordered graphs

Abhishek Methuku, István Tomon

A zero-one matrix $M$ contains a zero-one matrix $A$ if one can delete some rows and columns of $M$ , and turn some 1-entries into 0-entries such that the resulting matrix is $A$ . T…

math.CO2019

On the weight of Berge- $F$ -free hypergraphs

Sean English, Dániel Gerbner, Abhishek Methuku +1

For a graph $F$ , we say a hypergraph is a Berge- $F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge- $F$ -free if i…

math.CO2019

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona +8

Suppose that the vertices of a graph $G$ are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it…

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

New bounds for a hypergraph Bipartite Turán problem

Beka Ergemlidze, Tao Jiang, Abhishek Methuku

Let $t$ be an integer such that $t \geq 2$ . Let $K_{2, t}^{(3)}$ denote the triple system consisting of the $2 t$ triples ${a, x_{i}, y_{i}}$ , ${b, x_{i}, y_{i}}$ for $1 \leq i \leq t$ , where t…

math.CO2019

$3$ -uniform hypergraphs without a cycle of length five

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

In this paper we show that the maximum number of hyperedges in a $3$ -uniform hypergraph on $n$ vertices without a (Berge) cycle of length five is less than $(0.254 + o (1)) n^{3/2}$ ,…

Generalized rainbow Turán problems

Set systems related to a house allocation problem

Bipartite Turán problems for ordered graphs

On the weight of Berge-F-free hypergraphs

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Edge colorings of graphs without monochromatic stars

New bounds for a hypergraph Bipartite Turán problem

3-uniform hypergraphs without a cycle of length five

On the weight of Berge- $F$ -free hypergraphs

$3$ -uniform hypergraphs without a cycle of length five