Andrzej Grzesik

Orcid: 0000-0003-2770-7180

According to our database1, Andrzej Grzesik authored at least 33 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graphs without a Rainbow Path of Length 3.
SIAM J. Discret. Math., March, 2024

Maximal edge colorings of graphs.
Eur. J. Comb., March, 2024

Forcing generalised quasirandom graphs efficiently.
Comb. Probab. Comput., January, 2024

2023
Quasirandom-Forcing Orientations of Cycles.
SIAM J. Discret. Math., December, 2023

Cycles of a given length in tournaments.
J. Comb. Theory, Ser. B, 2023

Subgraph Densities in $K_r$-Free Graphs.
Electron. J. Comb., 2023

2022
Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free Graphs.
ACM Trans. Algorithms, 2022

On the maximum number of odd cycles in graphs without smaller odd cycles.
J. Graph Theory, 2022

The maximum number of paths of length three in a planar graph.
J. Graph Theory, 2022

The Turán number of blow-ups of trees.
J. Comb. Theory, Ser. B, 2022

Packing and covering directed triangles asymptotically.
Eur. J. Comb., 2022

Tuza's Conjecture for Threshold Graphs.
Discret. Math. Theor. Comput. Sci., 2022

On the inducibility of oriented graphs on four vertices.
Discret. Math., 2022

On tripartite common graphs.
Comb. Probab. Comput., 2022

2021
Exact hyperplane covers for subsets of the hypercube.
Discret. Math., 2021

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs.
Electron. J. Comb., 2021

2020
Cycles of length three and four in tournaments.
J. Comb. Theory, Ser. A, 2020

Covering minimal separators and potential maximal cliques in P<sub>t</sub>-free graphs.
CoRR, 2020

2019
Minimum number of edges that occur in odd cycles.
J. Comb. Theory, Ser. B, 2019

Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Analytic representations of large graphs.
Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018
Optimal-size clique transversals in chordal graphs.
J. Graph Theory, 2018

Elusive extremal graphs.
CoRR, 2018

2017
Extremal graph theory and finite forcibility.
Electron. Notes Discret. Math., 2017

Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs.
CoRR, 2017

On the Caccetta-Häggkvist Conjecture with a Forbidden Transitive Tournament.
Electron. J. Comb., 2017

2015
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path.
SIAM J. Discret. Math., 2015

Finitely forcible graphons and permutons.
J. Comb. Theory, Ser. B, 2015

Avoider-Enforcer star games.
Discret. Math. Theor. Comput. Sci., 2015

2014
Interval edge-colorings of K<sub>1, m, n</sub>.
Discret. Appl. Math., 2014

2013
Interval edge-colorings of K_{1, m, n}.
CoRR, 2013

2012
On the maximum number of five-cycles in a triangle-free graph.
J. Comb. Theory, Ser. B, 2012

Indicated coloring of graphs.
Discret. Math., 2012


  Loading...