E-LIB Suche - Ergebnisse für: Methuku, Abhishek

1

Cycles with many chords:

Draganić, Nemanja ; Methuku, Abhishek ; Munhá Correia, David.
Random Structures & Algorithms. 65 (2024) 1 - p. 3-16 , 2024

Link: https://doi.org/10.1002/..

2

Tight General Bounds for the Extremal Numbers of 0–1 Matric..:

Janzer, Barnabás ; Janzer, Oliver ; Magnan, Van.
International Mathematics Research Notices. 2024 (2024) 15 - p. 11455-11463 , 2024

Link: https://doi.org/10.1093/..

3

The Extremal Number of Cycles with All Diagonals:

Bradač, Domagoj ; Methuku, Abhishek ; Sudakov, Benny
International Mathematics Research Notices. 2024 (2024) 12 - p. 9728-9742 , 2024

Link: https://doi.org/10.1093/..

4

Rainbow subdivisions of cliques:

Jiang, Tao ; Letzter, Shoham ; Methuku, Abhishek.
Random Structures & Algorithms. 64 (2023) 3 - p. 625-644 , 2023

Link: https://doi.org/10.1002/..

5

New bounds on the size of nearly perfect matchings in almos..:

Kang, Dong Yeap ; Kühn, Daniela ; Methuku, Abhishek.
Journal of the London Mathematical Society. 108 (2023) 5 - p. 1701-1746 , 2023

Link: https://doi.org/10.1112/..

6

Rainbow Turán number of clique subdivisions:

Jiang, Tao ; Methuku, Abhishek ; Yepremyan, Liana
European Journal of Combinatorics. 110 (2023) - p. 103675 , 2023

Link: https://doi.org/10.1016/..

7

Counting cliques in 1-planar graphs:

Gollin, J. Pascal ; Hendrey, Kevin ; Methuku, Abhishek..
European Journal of Combinatorics. 109 (2023) - p. 103654 , 2023

Link: https://doi.org/10.1016/..

8

Turán problems for edge-ordered graphs:

Gerbner, Dániel ; Methuku, Abhishek ; Nagy, Dániel T....
Journal of Combinatorial Theory, Series B. 160 (2023) - p. 66-113 , 2023

Link: https://doi.org/10.1016/..

9

Ramsey numbers of Boolean lattices:

Grósz, Dániel ; Methuku, Abhishek ; Tompkins, Casey
Bulletin of the London Mathematical Society. 55 (2023) 2 - p. 914-932 , 2023

Link: https://doi.org/10.1112/..

10

On the Turán Number of the Blow-Up of the Hexagon:

Janzer, Oliver ; Methuku, Abhishek ; Nagy, Zoltán Lóránt
SIAM Journal on Discrete Mathematics. 36 (2022) 2 - p. 1187-1199 , 2022

Link: https://doi.org/10.1137/..

11

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic a..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Kang, Dong Yeap ; Kelly, Tom ; Kuhn, Daniela.. - p. 1080-1089 , 2022

Link: https://doi.org/10.1109/..

12

Bipartite Turán Problems for Ordered Graphs:

Methuku, Abhishek ; Tomon, István
Combinatorica. 42 (2022) 6 - p. 895-911 , 2022

Link: https://doi.org/10.1007/..

13

Vertex Turán problems for the oriented hypercube:

Gerbner, Dániel ; Methuku, Abhishek ; Nagy, Dániel T...
Acta Universitatis Sapientiae, Mathematica. 13 (2021) 2 - p. 356-366 , 2021

Link: https://doi.org/10.2478/..

14

Rainbow Ramsey Problems for the Boolean Lattice:

Chang, Fei-Huang ; Gerbner, Dániel ; Li, Wei-Tian...
Order. 39 (2021) 3 - p. 453-463 , 2021

Link: https://doi.org/10.1007/..

15

Triangles in C5‐free graphs and hypergraphs of girth six:

Ergemlidze, Beka ; Methuku, Abhishek
Journal of Graph Theory. 99 (2021) 1 - p. 26-39 , 2021

Link: https://doi.org/10.1002/..