FP
Florian Pfender
math.COcs.DMcs.CC
On Valency
published · living versionsW_3qer5dmp·v1 · currentpublished
Crossing numbers of complete bipartite graphs
with József Balogh, Nicholas Layman, Bernard Lidický, Gelasio Salazar +2
1 version
Preprints & journals
41 papers in the corpus · 2005–2026Crossing numbers of complete bipartite graphs2610.25204v1 · J'ozsef Balogh, Nicholas Layman, Bernard Lidick'y et al.2026 · 3 citationsarXivon Valency
A short proof that 2609.01782v1 · Samuel Harris, Zion Hefty, Paul Horn et al.2026 · 0 citationsarXiv
Semi-Inducibility of some small graphs2601.03433v1 · J'ozsef Balogh, Bernard Lidick'y, Dhruv Mubayi et al.2026 · 0 citationsarXiv
A polynomial improvement for the odd cycle-complete Ramsey numbers2511.10641v2 · Marcelo Campos, Matthew Jenssen, Marcus Michelen et al.2025 · 0 citationsarXiv
Improving in just two bites2510.19718v3 · Zion Hefty, Paul Horn, Dylan King et al.2025 · 0 citationsarXiv
On Relative Ordered Turán Density2508.05515v2 · Dylan King, Bernard Lidick'y, Minghui Ouyang et al.2025 · 0 citationsarXiv
The Hypergraph Turán Densities of Tight Cycles Minus an Edge2409.14257v2 · Bernard Lidicky, Connor Mattes, Florian Pfender2024 · 0 citationsarXiv
Small Ramsey numbers for books, wheels, and generalizations2407.07285v2 · Bernard Lidick'y, Gwen McKinley, Florian Pfender et al.2024 · 4 citationsarXiv
Triangle Percolation on the Grid2303.15402v2 · Igor Araujo, Bryce Frederickson, Robert A. Krueger et al.2023 · 0 citationsarXiv
Inducibility of 4-vertex tournaments2103.07047v2 · Dalton Burke, Bernard Lidick'y, Florian Pfender et al.2021 · 1 citationarXiv
is almost a fractalizer2102.06773v4 · Bernard Lidick'y, Connor Mattes, Florian Pfender2021 · 5 citationsarXiv
Edge-maximal graphs on orientable and some non-orientable surfaces1911.02666v1 · James Davies, Florian Pfender2019 · 6 citationsarXiv
Making -Free Graphs -partite1910.00028v1 · J'ozsef Balogh, Felix Christian Clemen, Mikhail Lavrov et al.2019 · 12 citationsarXiv
Sharp bounds for decomposing graphs into edges and triangles1909.11371v3 · Adam Blumenthal, Bernard Lidick'y, Yanitsa Pehova et al.2019 · 3 citationsCombinator. Probab. Comp. 30 (2021) 271-287
Counterexamples to a conjecture of Harris on Hall ratio1811.11116v4 · Adam Blumenthal, Bernard Lidicky, Ryan R. Martin et al.2018 · 4 citationsarXiv
Inducibility of directed paths1811.03747v2 · Ilkyoo Choi, Bernard Lidick'y, Florian Pfender2018 · 14 citationsDiscrete Mathematics 343 (2020) 112015
Erdős-Szekeres On-Line1804.05952v2 · Kirk Boyer, Lauren M. Nelsen, Luke L. Nelsen et al.2018 · 0 citationsarXiv
Pentagons in triangle-free graphs1712.08869v1 · Bernard Lidick'y, Florian Pfender2017 · 17 citationsEuropean Journal of Combinatorics 74 (2018) 85-89
Notes on complexity of packing coloring1712.08373v1 · Minki Kim, Bernard Lidick'y, Tom'as Masar'ik et al.2017 · 10 citationsInformation Processing Letters 137 (2018) 6-10
On Edge-Colored Saturation Problems1712.00163v1 · Michael Ferrara, Daniel Johnston, Sarah Loeb et al.2017 · 3 citationsarXiv
Semidefinite Programming and Ramsey Numbers1704.03592v2 · Bernard Lidick'y, Florian Pfender2017 · 21 citationsarXiv
Ore and Chvátal-type Degree Conditions for Bootstrap Percolation from Small Sets1610.04499v3 · Michael Dairyko, Michael Ferrara, Bernard Lidick'y et al.2016 · 7 citationsarXiv
Color-line and Proper Color-line Graphs1511.01025v2 · Van Bang Le, Florian Pfender2015 · 0 citationsarXiv
Increasing paths in edge-ordered graphs: the hypercube and random graphs1502.03146v1 · Jessica De Silva, Theodore Molla, Florian Pfender et al.2015 · 4 citationsarXiv
Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle1411.4645v1 · J'ozsef Balogh, Ping Hu, Bernard Lidick'y et al.2014 · 51 citationsarXiv
Crossing numbers of complete tripartite and balanced complete multipartite graphs1410.0720v1 · Ellen Gethner, Leslie Hogben, Bernard Lidick'y et al.2014 · 22 citationsarXiv
Rainbow triangles in three-colored graphs1408.5296v1 · Jozsef Balogh, Ping Hu, Bernard Lidicky et al.2014 · 32 citationsarXiv
Graph Saturation in Multipartite Graphs1408.3137v1 · Michael Ferrara, Michael S. Jacobson, Florian Pfender et al.2014 · 12 citationsarXiv
Complexity Results for Rainbow Matchings1312.7253v1 · Van Bang Le, Florian Pfender2013 · 20 citationsarXiv
Total weight choosability in Hypergraphs1312.6329v1 · Florian Pfender2013 · 0 citationsarXiv
The 1-2-3 Conjecture for Hypergraphs1308.0611v2 · Maciej Kalkowski, MichałKaro'nski, Florian Pfender2013 · 14 citationsarXiv
Quartic graphs with every edge in a triangle1308.0081v1 · Florian Pfender, Gordon F. Royle2013 · 4 citationsarXiv
Monochromatic triangles in three-coloured graphs1206.1987v1 · James Cummings, Daniel Kr'al', Florian Pfender et al.2012 · 40 citationsarXiv
Combined degree and connectivity conditions for H-linked graphs1206.1427v1 · Florian Pfender2012 · 0 citationsarXiv
Large rainbow matchings in large graphs1204.3193v1 · Alexandr Kostochka, Florian Pfender, Matthew Yancey2012 · 8 citationsarXiv
Rainbow Matchings of size \delta(G) in Properly Edge-colored Graphs1108.2521v1 · Jennifer Diemunsch, Michael Ferrara, Casey Moffatt et al.2011 · 21 citationsarXiv
Total Vertex Irregularity Strength of Forests1103.2087v1 · Marcin Anholcer, MichałKaro'nski, Florian Pfender2011 · 3 citationsarXiv
Total Edge Irregularity Strength of Large Graphs1006.4501v1 · Florian Pfender2010 · 10 citationsarXiv
Complete subgraphs in multipartite graphs0910.1447v1 · Florian Pfender2009 · 12 citationsarXiv
Rooted induced trees in triangle-free graphs0804.1535v2 · Florian Pfender2008 · 4 citationsarXiv
Improved Delsarte bounds for spherical codes in small dimensionsmath/0501493v2 · Florian Pfender2005 · 15 citationsJ. Combin. Theory Ser. A 114 (2007) Issue 6, 1133-1147
Career total: 93 works. 41 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.