Bernard Lidický

Papers submitted to journals and conferences

1. József Balogh, Peter Bradshaw, Ramon I. Garcia, Bernard Lidický
   Density of rainbow triangles and properly colored $K_4$'s submitted (2025)
   arXiv
2. Daniel Brosch, Bernard Lidický, Sydney Miyasaki, Diane Puges
   Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers submitted (2025)
   arXiv program
3. Oliver Eilenstein, Anastasia Halfpap, Bernard Lidický, Florian Pfender, Sydney Miyasaki, Jan Volec
   Maximum number of conflicts in phylogenetic trees submitted (2025)
   program
4. Dylan King, Bernard Lidický, Minghui Ouyang, Florian Pfender, Runze Wang, Zimu Xiang
   On Relative Ordered Turán Density submitted (2025)
   arXiv
5. Zdeněk Dvořák, Bernard Lidický, Bojan Mohar
   On a conjecture concerning 4-coloring of graphs with one crossing submitted (2025).
   arXiv program
6. Arnbjörg Soffía Árnadóttir, Zdeněk Dvořák, Bernard Lidický, Benjamin Moore, Evelyne Smith-Roberge, Robert Šámal
   Flow-critical graphs submitted (2025)
   arXiv
7. József Balogh, Anastasia Halfpap, Bernard Lidický, Cory Palmer
   Positive co-degree densities and jumps submitted (2024)
   arXiv program slides
8. Bernard Lidický, Connor Mattes, Florian Pfender
   The Hypergraph Turán Densities of Tight Cycles Minus an Edge submitted (2024)
   arXiv program
9. Anastasia Halfpap, Bernard Lidický, Tomáš Masařík
   Proper Rainbow Saturation Numbers for Cycles submitted (2024)
   arXiv program
10. Caroline Bang, Zdeněk Dvořák, Emily Heath, Bernard Lidický
    Embedded graph 3-coloring and flow submitted (2023)
    arXiv Talk by Zdeněk (local copy)
11. Dalton Burke, Bernard Lidický, Florian Pfender, Michael Phillips
    Inducibility of 4-vertex tournaments submitted. (2021)
    program arXiv

Papers in refereed journals

1. Bernard Lidický, Gwen McKinley, Florian Pfender, Steven Van Overberghe
   Small Ramsey numbers for books, wheels, and generalizations Accepted to Electronic Journal of Combinatorics
   arXiv program 1 program 2
2. Michelle Delcourt, Catherine Greenhill, Mikhail Isaev, Bernard Lidický, Luke Postle
   Decomposing random regular graphs into stars European Journal of Combinatorics 130 (2025) 104216
   arXiv doi (early slides)
3. Zdeněk Dvořák, Bernard Lidický, Luke Postle
   11/4-colorability of subcubic triangle-free graphs Advances in Combinatorics 2025:5, 61pp.
   arXiv doi program slides
4. József Balogh, Domagoj Bradač, Bernard Lidický
   Weighted Turán theorems with applications to Ramsey-Turán type of problems Journal of Graph Theory 110 (2025) 59-71.
   arXiv doi
5. Igor Araujo, Bryce Frederickson, Robert A. Krueger, Bernard Lidický, Tyrrell B. McAllister, Florian Pfender, Sam Spiro, Eric Nathan Stucky
   Triangle Percolation on the Grid Discrete and Computational Geometry 73 (2025) 569-593.
   arXiv doi
6. József Balogh, Felix C. Clemen, Bernard Lidický
   10 Problems for Partitions of Triangle-free Graphs European Journal of Combinatorics (special issue of Eurocomb 2021), 121 (2024) paper 103841.
   arXiv doi program
7. Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický
   Relaxation of Wegner’s Planar Graph Conjecture for maximum degree 4 Discrete Applied Mathematics 358 (2024) (2024) 254-261.
   doi arXiv
8. Bernard Lidický, Connor Mattes, Florian Pfender
   $C_5$ is almost a fractalizer Journal of Graph Theory 104 (2023) 220-244.
   program arXiv doi
9. József Balogh, Felix C. Clemen, Bernard Lidický, Sergey Norin, Jan Volec
   The Spectrum of Triangle-free Graphs SIAM J. Discrete Math 37 (2023) 1173–1179
   arXiv doi
10. Rachel Kirsch, Bernard Lidický, Clare Sibley, Elizabeth Sprangel
    Shortened Universal Cycles for Permutations Discrete Applied Math, 324 (2023) 219-228.
    arXiv doi
11. József Balogh, Felix C. Clemen, Bernard Lidický
    Solving Turán's Tetrahedron Problem for the $\ell_2$-Norm Journal of the London Mathematical Society, 106 (2022).
    arXiv program doi
12. Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec
    On tripartite common graphs Combinatorics, Probability and Computing, 31 (2022) 907-923.
    program arXiv doi
13. József Balogh, Felix C. Clemen, Bernard Lidický
    Maximum Number of Almost Similar Triangles in the Plane Computational Geometry: Theory and Applications, 105–106 (2022), 101880.
    program arXiv slides youtube doi
14. József Balogh, Felix C. Clemen, Bernard Lidický
    Hypergraph Turán Problems in $\ell_2$-Norm Surveys in Combinatorics, 2022: Invited lectures from the 29th British Combinatorial Conference (2022) 21-63.
    arXiv program doi
15. Bernard Lidický, Tomáš Masařík, Kyle Murphy, Shira Zerbib
    On Weak Flexibility in Planar Graphs Graphs and Combinatorics 38:180 (2022).
    program arXiv doi
16. Daniel Cranston, Bernard Lidický, Xiaonan Liu, Abhinav Shantanam
    Planar Turán Numbers of Cycles: A Counterexample Electronic Journal of Combinatorics 29 (2022) P3.31.
    arXiv doi
17. Jane Breen, Steve Butler, Melissa Fuentes, Bernard Lidický, Michael Philips, Alexander W. N. Riasanovsky, Sung-Yell Song, Ralihe R. Villagrán, Cedar Wiesman, Xiaohong Zhang
    Hadamard diagonalizable graphs of order at most 36 Electronic Journal of Combinatorics, 29 (2022) P2.16.
    program and data arXiv doi
18. Zdeněk Dvořák, Bernard Lidický:
    Coloring count cones of planar graphs, Journal of Graph Theory, 100 (2022), 84-100.
    arXiv doi program slides
19. Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec:
    Counterexamples to a conjecture of Harris on Hall ratio, SIAM J. Discrete Math. 36 (2022), 1678-1686.
    arXiv doi
20. Bernard Lidický, Florian Pfender:
    Semidefinite Programming and Ramsey Numbers, SIAM J. Discrete Math, 35 (2021), 2328-2344.
    arXiv doi slides
21. Bernard Lidický, Kyle Murphy:
    Maximizing five-cycles in K_r-free graphs European J. Combinatorics, 97 (2021), 103367.
    arXiv doi
22. József Balogh, Felix C. Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender:
    Making K_r+1-Free Graphs r-partite Combinatorics, Probability and Computing, 30 (2021) 609-618.
    arXiv doi
23. Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec:
    Sharp bounds for decomposing graphs into edges and triangles Combinatorics, Probability and Computing, 30 (2021), 271-287.
    arXiv slides doi
24. Ilkyoo Choi, Bernard Lidický, Florian Pfender:
    Inducibility of directed paths, Discrete Math., 343 (2020), 112015.
    arXiv program doi
25. Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell
    Ore and Chvátal-type Degree Conditions for Bootstrap Percolation from Small Sets, J. of Graph Theory, 94 (2020), 252-266.
    arXiv doi
26. Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko:
    Minimizing the number of 5-cycles in graphs with given edge-density, Combinatorics, Probability and Computing, 29 (2020), 44-67.
    arXiv doi
27. József Balogh, Bernard Lidický, Gelasio Salazar:
    Closing in on Hill’s conjecture, SIAM J. Discrete Math., 33 (2019), 1261–1276.
    arXiv doi program
28. Bernard Lidický, Kacy Messerschmidt, Riste Škrekovski:
    Facial unique-maximum colorings of plane graphs with restriction on big vertices, Discrete Math. 342 (2019) 2612-2617.
    arXiv doi
29. Matia Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner:
    Partition problems in high dimensional boxes, Journal of Comb. Theory A. 166 (2019) 315-336
    arXiv doi
30. Maria Axenovich, John Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John Talbot, Michael Young:
    Polychromatic Colorings on the Integers, Integers. 19 (2019) A18
    arXiv
31. Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova:
    Decomposing graphs into edges and triangles, Combinatorics, Probability and Computing. 28 (2019) 465-472.
    arXiv doi program older long version slides
32. Zdeněk Dvořák, Bernard Lidický:
    Fine structure of 4-critical triangle-free graphs I. Planar graphs with two triangles and 3-colorability of chains, SIAM J. Discrete Math. 32 (2018), 1775-1805.
    arXiv doi slides
33. Philip DeOrsey Jennifer Diemunsch, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Sohol Jahanbekam, Bernard Lidický, Luke Nelsen, Derrick Stolee, Eric Sullivan:
    On the Strong Chromatic Index of Sparse Graphs, Electronic Journal of Combinatorics. 25-3 (2018) P18
    arXiv pdf doi
34. John Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John Talbot, Michael Young:
    Polychromatic Colorings on the Hypercube, Journal of Combinatorics, 9 (2018) 631-657.
    arXiv
35. Bernard Lidický, Florian Pfender:
    Pentagons in triangle-free graphs, European J. of Combinatorics. 74 (2018), 85–89.
    arXiv doi program
36. Minki Kim, Bernard Lidický, Tomáš Masařík, Florian Pfender:
    Notes on complexity of packing coloring, Information Processing Letters 137 (2018), 6-10.
    arXiv doi
37. Zdeněk Dvořák, Bernard Lidický:
    Fine structure of 4-critical triangle-free graphs III. General surfaces, SIAM J. Discrete Math. 32 (2018), 94-105.
    arXiv doi slides
38. Bernard Lidický, Kacy Messerschmidt, Riste Škrekovski:
    A counterexample to a conjecture on facial unique-maximal colorings Discrete Applied Math. 237 (2018), 123-125.
    arXiv doi slides
39. Vesna Andova, Bernard Lidický, Borut Lužar, Riste Škrekovski:
    On facial unique-maximum (edge-)coloring, Discrete Applied Math. 237 (2018), 26-32.
    arXiv doi slides
40. Maria Axenovich, John Goldwasser, Ryan Hansesn, Bernard Lidický, Ryan R. Martin, David Offner, John Talbot, Michael Young:
    Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles, J. of Graph Theory 87 (2018) 660--671.
    arXiv doi slides
41. Ilkyoo Choi, Jan Ekstein, Přemek Holub, Bernard Lidický
    3-coloring triangle-free planar graphs with a precolored 9-cycle European J. of Combinatorics 68, (2018) 38-65.
    arXiv doi
    conference version at IWOCA 2014. doi - IWOCA slides
42. Jan Kynčl, Bernard Lidický, Tomáš Vyskočil:
    Irreversible 2-conversion set in graphs of bounded degree Discrete Mathematics & Theoretical Computer Science 19 (2017)
    arXiv journal
    doi preliminary version KAM-DIMATIA Series 933 (2009)
43. József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young:
    Rainbow triangles in three-colored graphs Journal of Comb. Theory B. 126 (2017), 83-113.
    arXiv slides doi
44. Zdeněk Dvořák, Bernard Lidický, Bojan Mohar:
    5-choosability of graphs with crossings far apart, Journal of Comb. Theory B 123, (2017), 54–96.
    arXiv slides doi >
45. Zdeněk Dvořák, Bernard Lidický, Bojan Mohar, Luke Postle:
    5-list-coloring planar graphs with distant precolored vertices, Journal of Comb. Theory B 122 (2017), 311–352.
    arXiv doi
46. Boris Brimkov, Jennifer Edmond, Rober Lazar, Bernard Lidický, Kacy Messerschmidt, Shanise Walker
    Injective choosability of subcubic planar graphs with girth 6, Discrete Math. 340 (2017), 2538-2549.
    arXiv (with program) doi
47. Zhanar Berikkyzy, Chris Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee:
    (4,2)-choosability of planar graphs with forbidden structures, Graphs and Combinatorics, 33 (2017), 751--787.
    arXiv doi
48. Zdeněk Dvořák, Bernard Lidický:
    Fine structure of 4-critical triangle-free graphs II. Planar triangle-free graphs with two precolored 4-cycles, SIAM J. Discrete Math. 31 (2017), 865--874.
    arXiv slides doi
49. Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young:
    Crossing numbers of complete tripartite and balanced complete multipartite graphs, J. of Graph Theory 84 (2017), 552-565
    arXiv doi program
50. Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomáś Valla
    On the Tree Search Problem with Non-uniform Costs Theoretical Computer Science 647 (2016), 22–32
    doi
    Also in WG 2015, Lecture Notes in Computer Science 9224 (2016), 90-102. doi arXiv slides
51. József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer:
    Rainbow copies of C₄ in edge-colored hypercubes, Discrete Applied Math. 210 (2016), 35–37
    doi
52. József Balogh, Ping Hu, Bernard Lidický, Florian Pfender:
    Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle European J. of Combinatorics 52 (2016), 47-58
    doi arXiv Ancillary files
53. Ilkyoo Choi, Bernard Lidický, Derrick Stolee:
    On Choosability with Separation of Planar Graphs with Forbidden Cycles J. of Graph Theory 81 (2016), 283-306
    doi arXiv
54. József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec:
    Minimum number of monotone subsequences of length 4 in permutations, Combinatorics, Probability and Computing 24 (2015), 658-679
    doi arXiv slides
55. Zdeněk Dvořák, Bernard Lidický:
    3-coloring triangle-free planar graphs with a precolored 8-cycle, J. of Graph Theory 80 (2015), 98–111
    doi arXiv slides
56. H.A. Kierstead, Bernard Lidický:
    On choosability with separation of planar graphs with lists of different sizes Discrete Math. 338 (2015), 1779-1783
    doi arXiv
57. Oleg V. Borodin, Zdeněk Dvořák, Alexandr V. Kostochka, Bernard Lidický, Matthew Yancey:
    Planar 4-critical graphs with four triangles, European J. of Combinatorics 41 (2014), 138-151
    arXiv doi slides
58. Zdeněk Dvořák, Bernard Lidický:
    4-critical graphs on surfaces without contractible (≤4)-cycles, SIAM J. Discrete Math. 28(1) (2014), 521–552
    dio arXiv slides
59. Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew Yancey:
    Short proofs of coloring theorems on planar graphs, European J. of Combinatorics 36 (2014), 314–321
    doi arXiv slides
60. József Balogh, Ping Hu, Bernard Lidický, Hong Liu:
    Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, European Journal of Combinatorics, 35 (2014), 75–85
    doi arXiv slides
61. Bernard Lidický, Hong Liu, Cory Palmer:
    On the Turán number of forests, Electronic Journal of Combinatorics, 20-2 (2013) P62
    arXiv doi
62. Sariel Har-Peled, Bernard Lidický:
    Peeling the Grid, SIAM J. Discrete Math. 27-2 (2013), 650-655
    doi arXiv
63. Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesař, Tomáš Vyskočil:
    The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree, Graphs and Combinatorics 29-4 (2013), 981-1005. doi arXiv
    Also at: Graph Drawing 2009, LNCS 5849 (2010), 304-314. doi PDF slides
64. Petr Golovach, Bernard Lidický, Barnaby Martin, Daniel Paulusma:
    Finding vertex-surjective graph homomorphisms, Acta Informatica 49 (2012) 381-394. arXiv dio
    Also at: CSR 2012, Lecture Notes in Computer Science 7353 (2012), 160-171. doi PDF
65. Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski:
    Bipartizing fullerenes, European J. of Combinatorics 33 (2012), 1286–1293. arXiv dio slides
66. Jiří Fiala, Petr Golovach, Jan Kratochvíl, Bernard Lidický, Daniel Paulusma:
    Distance Three Labelings of Trees, Discrete Applied Math. 160 (2012), 764-779. preprint doi
    Also includes: Petr Golovach, Bernard Lidický, Daniel Paulusma:
    L(2,1,1)-labeling is NP-complete for trees, LNCS 6108 (2010), 211-221. TAMC 2010 doi slides
67. Jan Ekstein, Přemek Holub, Bernard Lidický:
    Packing Chromatic Number of Distance Graphs, Discrete Applied Math. 160 (2012), 518-524. arXiv sources doi
68. Jiří Fiala, Marcin Kaminski, Bernard Lidický, Daniel Paulusma:
    The k-in-a-path problem for claw-free graphs, Algorithmica 62 (2012), 499-519. dio
    Also in: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science,
    LIPIcs 5 (2010), 371-382. STACS 2010 arXiv doi slides
69. Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski:
    Graphs with two crossings are 5-choosable, SIAM J. on Discrete Math. 25 (2011), 1746-1753. arXiv doi slides
70. Rok Erman, Frédéric Havet, Bernard Lidický, Ondřej Pangrác:
    5-colouring graphs with 4 crossings, SIAM J. on Discrete Math. 25 (2011), 401-422. preprint doi slides
71. Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski:
    Randic index and the diameter of a graph, European Journal of Combinatorics 32 (2011), 434-442. preprint doi
72. Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski:
    3-choosability of triangle-free planar graphs with constraint on 4-cycles, SIAM J. on Discrete Math. 24 (2010), 934-945. preprint doi slides
73. Tomáš Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Šámal:
    Short cycle covers of graphs with minimum degree three, SIAM J. Discrete Math. 24 (2010), 330-355 arXiv doi slides
74. Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski:
    On 3-choosability of plane graphs without 3-,7- and 8- cycles, Discrete Math. 309 (2009), 5899-5904 preprint doi slides
75. Ken-ichi Kawarabayashi, Daniel Král', Jan Kynčl, Bernard Lidický:
    6-critical graphs on the Klein bottle, SIAM J. on Discrete Math. 23 (2009), 372-383, preprint, sources doi
76. Bernard Lidický:
    On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles, Australasian Journal of Combinatorics 44 (2009), 77-86, preprint slides
77. Jiří Fiala, S. Klavžar, Bernard Lidický:
    The packing chromatic number of infinite product graphs, European Journal of Combinatorics 30 (2009), 1101-1113 preprint doi slides

Papers in refereed conference proceedings only (no journal version)

1. József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro
   Crossing numbers of complete bipartite graph XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023) Procedia Computer Science 223 (2023) 78-87. doi slides
2. József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
   Nearly all $k$-SAT functions are unate 55th Annual ACM Symposium on Theory of Computing (STOCS 2023) 958-962. arXiv doi slides
3. Ping Hu, Bernard Lidický, Taísa L. Martins, Sergey Norin, Jan Volec
   Large multipartite subgraphs in H-free graphs" At Eurocomb 2021. Trends in Mathematics, Springer International Publishing (2021) 707-713. doi
4. József Balogh, Felix C. Clemen, Bernard Lidický
   Max Cuts in Triangle-free Graphs At Eurocomb 2021. Trends in Mathematics, Springer International Publishing (2021) 509-514. arXiv doi
5. Zdeněk Dvořák, Bernard Lidický:
   Independent sets near the lower bound in bounded degree graphs, LIPIcs 66, STACS 2017. arXiv doi slides
6. Daniel Nikovski, Bernard Lidický, Weihong Zhang, Kenji Kataoka, Koki Yoshimoto:
   Markov decision processes for train run curve optimization IEEE ESARS 2012 (Electircal System for Aircraft, Railway and Ship Propulsion) doi
7. Ondřej Bílka, Bernard Lidický, Marek Tesař:
   Locally injective homomorphism to the simple Weight graphs LNCS 6648 (2011), 471-482. TAMC 2011 doi slides
8. Bernard Lidický, Marek Tesař:
   Complexity of locally injective homomorphism to the Theta graphs, LNCS 6460 (2011), 326-336. IWOCA 2010 doi
9. Anthony Maitos, Filip Jordán, Bernard Lidický, Karel Kabele, Paul Strachan
   Coupling building simulation with a hardware real-time controller Simulace budov a techniky prostředí 2010, CVUT (2010), 115-120.
10. Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický:
    Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters, LNCS 5417 (2009), 121-132. Graph Drawing 2008 doi

Papers in conference proceedings (no journal version)

1. Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král', Jan Kynčl, Bernard Lidický:
   Six-Critical Graphs on the Klein Bottle, Electronic Notes in Discrete Mathematics 31 (2008), 235-240. Topological and Geometric Graph Theory 2008 doi

Other manuscripts

1. Daniel Nikovsky, Bernard Lidický:
   US patent 8,938,348B2, METHOD FOR OPTIMIZING RUN CURVE OF VEHICLES (2015)
2. Frédéric Havet, Bernard Lidický:
   Splitting a tournament into two subtournaments with given minimum outdegree (2014) Some overlap with other paper
3. Bernard Lidický:
   Doctoral thesis (2011)
4. Jan Ekstein, Jiří Fiala, Přemek Holub, Bernard Lidický:
   The packing chromatic number of the square lattice is at least 12 arXiv sources (2010)
5. Petr Kolman, Bernard Lidický, Jean-Sébastien Sereni:
   On Minimum Fair Odd Cycle Transversal KAM-DIMATIA Series 956 (2010)

Some slides (including all the mistkes)

• Jan 11, 2025 JMM - Positive co-degree densities and jumps
• Sep 18, 2023 LAGOS - Crossing numbers of complete bipartite graphs
• Jun 12, 2023 FOCM - Flag Algebras and Weighted Turan problems with applications to Ramey-Turan questions
• May 27, 2023 Excill 4 - Almost all $k$-sat functions are unate
• Apr 23, 2023 CombinaTexas - Applications of Flag Algebras
• Mar 18, 2023 AMS - Almost all $k$-sat functions are unate
• Oct 22 2022 AMS - l2-norm in Turán Type Problems
• Apr 27 2022 MTSU/Vanderbilt seminar - Maximum Number of Almost Similar Triangles in the Plane
• Feb 28 2022 Warwick seminar - 11/4-colorability of subcubic triangle-free graphs
• Jul 20 2021 SIAM - Maximizing five cycles in $K_r$-free graphs
• Apr 28 2021 Gatech seminar - Maximum Number of Almost Similar Triangles in the Plane
• Oct 17 2020 SIAM TXLA - Flexibility In Planar Graphs
• May 28 2019 CanaDAM - Coloring count cones of planar graphs
• Apr 7 2019 6th Lake Michigan Workshop on Combinatorics and Graph Theory Flag Algebras 1 Flag Algebras 2 Aplications
• Mar 30 2019 Atlanta Lecture Series - Decomposing graphs into edges and triangles (50 minutes talk)
• Oct 20 2018 AMS - Decomposing graphs into edges and triangles
• Jun 6 2018 SIAM - Polychromatic Colorings of Complete Graphs with Respect to 1-,2-factors and Hamiltonian Cycles
• Sep 16 2017 AMS - Unique maximum facial colorings
• Apr 29 2017 MMMM - Small Ramsey numbers
• Apr 2 2017 AMS - Independent sets near the lower bound in bounded degree graphs
• Oct 29 2016 AMS - Independent sets near the lower bound in bounded degree graphs
• Sep 5 2016 Cycles and Colourings - 3-coloring traingle-free planar graphs (plenary talk)
• 10.8.2016 Exill 3 - Decomposing Random d-regular Graphs Into Stars
• Oct 3 2015 AMS - Precoloring extension for planar graphs
• Jun 5 2015 CSGT - Flag Algebras and Some Applications (plenary talk)
• Feb 15 2015 Atlanta Lecture Series - Upper bounds on small Ramsey numbers
• Feb 4 2015 Iowa State - Triangles and 3-coloring of planar graphs (talk for students)
• Nov 7 2014 Michigan Tech - Flag Algebras and Applications to Permutations
• Oct 17 2014 IWOCA - 3-coloring triangle-free planar graphs with a precolored 9-cycle
• Sep 21 2014 AMS - Rainbow triangles in 3-edge-colored graphs
• Jun 17 2014 SIAM - Rainbow triangles in 3-edge-colored graphs
• May 17 2014 Cumberland - On the Tree Search Problem with Non-uniform costs
• Jan 25 2014 Atlanta Lecture Series - Number of monotone subsequences of length four in permutations
• Oct 6 2013 AMS - Extending 3-coloring of a face in triangle-free planar graphs
• Jul 9 2013 CSTGA - 3-coloring planar graphs with four triangles
• Apr 13 2013 AMS - Short proofs of coloring theorems on planar graphs
• Apr 6 2013 MIGHTY LIV - 3-coloring planar graphs with four triangles
• Mar 2 2013 AMS - Short proofs of coloring theorems on planar graphs
• Sep 22 2012 MIGHTY LIII - 4-critical graphs on surfaces without contractible cycles of length at most 4
• May 19 2012 SIAM - L(2,1,1)-labeling is NP-Complete for trees
• May 18 2012 SIAM - 4-critical graphs on surfaces without contractible cycles of length at most 4
• May 12 2012 Cumberland - The planar slope-number of planar partial 3-trees of bounded degree
• Mar 18 2012 AMS - Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Jan 27 2012 Postdoctoral Research Symposium - Bipartizing fulerenes
• Jun 23 2011 Bled - Packing Coloring and Grids
• May 31 2011 CanaDAM - List coloring and crossings
• Sep 6 2010 Cycles and Colourings - Packing chromatic number for square and hexagonal lattice
• Jun 17 2010 SIAM - 5-Coloring Graphs with 4 Crossings
• Feb 16 2010 ATCAGC - Computational Complexity of Locally Injective Homomorphisms to Weight Graphs: A Full Classification of Simple Weights
• Jan 22 2010 CSASC - The k-in-a-path problem for claw-free graphs
• May 27 2009 CanaDAM - On 3-chosability of triangle free planar graphs
• Sep 12 2008 Cycles and Colourings - Short cycle covers of graphs with minimum degree three
• Sep 3 2007 Cycles and Colourings - Packing chromatic number for lattices
• Mar 5 2007 Winter School on Combinatorcis - Discharging and list coloring

Top 3 coauthors

• József Balogh
• Zdeněk Dvořák
• Florian Pfender