17 citations · 57 across the 36 of their papers we have counts for
5 papers · 2 filters
Random Turán theorem for hypergraph cycles
Dhruv Mubayi, Liana Yepremyan
Given -uniform hypergraphs and the Turán number is the maximum number of edges in an -free subgraph of . We study the typical value of $\rm ex(G, H)…
Linear cycles of consecutive lengths
Tao Jiang, Jie Ma, Liana Yepremyan
A well-known result of Verstraëte \cite{V00} shows that for each integer every graph with average degree at least contains cycles of consecutive even lengths…
New bounds for Ryser's conjecture and related problems
Peter Keevash, Alexey Pokrovskiy, Benny Sudakov +1
A Latin square of order is an array filled with symbols such that each symbol appears only once in every row or column and a transversal is a collection of cel…
Full rainbow matchings in equivalence relations
David Munhá Correia, Liana Yepremyan
We show that if a multigraph with maximum edge-multiplicity of at most , is edge-coloured by colours such that each colour class is a disjoint un…
Notes on Tree- and Path-chromatic Number
Tony Huynh, Bruce Reed, David R. Wood +1
Tree-chromatic number is a chromatic version of treewidth, where the cost of a bag in a tree-decomposition is measured by its chromatic number rather than its size. Path-chromatic…