11 citations · 24 across the 14 of their papers we have counts for
15 papers
The density Turán problem for hypergraphs
Adam Sanitt, John Talbot
Given a -graph a complete blow-up of is a -graph formed by replacing each by a non-empty vertex class and then inserting all edges between…
Decomposing tournaments into paths
Allan Lo, Viresh Patel, Jozef Skokan +1
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomp…
Polychromatic Colorings on the Integers
Maria Axenovich, John Goldwasser, Bernard Lidický +4
We show that for any set , there exists a 3-coloring of in which every translate of receives all three colors. This implies that …
Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles
Maria Axenovich, John Goldwasser, Ryan Hansen +5
If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…
Polychromatic Colorings on the Hypercube
John Goldwasser, Bernard Lidický, Ryan R. Martin +3
Given a subgraph G of the hypercube Q_n, a coloring of the edges of Q_n such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The max…
An exact Turán result for tripartite 3-graphs
Adam Sanitt, John Talbot
Mantel's theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. We prove an analogue of this r…