2 citations · 4 across the 18 of their papers we have counts for
5 papers · 2 filters
The double Hall property and cycle covers in bipartite graphs
János Barát, Andrzej Grzesik, Attila Jung +2
In a graph , the -neighborhood of a vertex set consists of all vertices of having at least neighbors in . We say that a bipartite graph satisfies the…
On triangle-free graphs maximizing embeddings of bipartite graphs
Dmitriy Gorovoy, Andrzej Grzesik, Justyna Jaworska
In 1991 Gy\H ori, Pach, and Simonovits proved that for any bipartite graph containing a matching avoiding at most 1 vertex, the maximum number of copies of in any large eno…
Directed graphs without rainbow triangles
Sebastian Babiński, Andrzej Grzesik, Magdalena Prorok
One of the most fundamental results in graph theory is Mantel's theorem which determines the maximum number of edges in a triangle-free graph of order . Recently a colorful vari…
Turán problems for oriented graphs
Andrzej Grzesik, Justyna Jaworska, Bartłomiej Kielak +2
A classical Turán problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph as a subgraph. It is well-known tha…
Forcing Generalized Quasirandom Graphs Efficiently
Andrzej Grzesik, Daniel Kral, Oleg Pikhurko
We study generalized quasirandom graphs whose vertex set consists of parts (of not necessarily the same sizes) with edges within each part and between each pair of parts distri…