8 citations · 27 across the 30 of their papers we have counts for
5 papers · 1 filter
Maximal edge colorings of graphs
Sebastian Babiński, Andrzej Grzesik
For a graph of order a maximal edge coloring is a proper edge coloring with colors such that adding any edge to in any color makes it improper. Meszka and Tyn…
The Maximum Number of Paths of Length Three in a Planar Graph
Andrzej Grzesik, Ervin Győri, Addisu Paulos +3
Let denote the maximum number of copies of possible in an -vertex planar graph. The function has been determined when is a cycle of length or b…
Packing and covering directed triangles asymptotically
Jacob W. Cooper, Andrzej Grzesik, Adam Kabela +1
A well-known conjecture of Tuza asserts that if a graph has at most pairwise edge-disjoint triangles, then it can be made triangle-free by removing at most edges. If true,…
The Turán number of blow-ups of trees
Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy
A conjecture of Erdős from 1967 asserts that any graph on vertices which does not contain a fixed -degenerate bipartite graph has at most edges, where i…
Cycles of length three and four in tournaments
Timothy F. N. Chan, Andrzej Grzesik, Daniel Kral +1
Linial and Morgenstern conjectured that, among all -vertex tournaments with cycles of length three, the number of cycles of length four is asymptotically minimiz…