Florian Pfender, Ph.D.
Affiliations: | 2002 | Emory University, Atlanta, GA |
Area:
MathematicsGoogle:
"Florian Pfender"Parents
Sign in to add mentor| Ronald Gould | grad student | 2002 | Emory | |
| (Four problems in extremal graph theory.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Choi I, Lidický B, Pfender F. (2020) Inducibility of directed paths Discrete Mathematics. 343: 112015 |
| Le VB, Pfender F. (2020) Color-line and proper color-line graphs Discrete Applied Mathematics. 278: 73-82 |
| Dairyko M, Ferrara M, Lidický B, et al. (2020) Ore and Chvátal‐type degree conditions for bootstrap percolation from small sets Journal of Graph Theory. 94: 252-266 |
| Kim M, Lidický B, Masařík T, et al. (2018) Notes on complexity of packing coloring Information Processing Letters. 137: 6-10 |
| Lidický B, Pfender F. (2018) Pentagons in triangle-free graphs European Journal of Combinatorics. 74: 85-89 |
| Balogh J, Hu P, Lidický B, et al. (2017) Rainbow triangles in three-colored graphs Journal of Combinatorial Theory, Series B. 126: 83-113 |
| Kalkowski M, Karoński M, Pfender F. (2017) The 1-2-3-Conjecture for Hypergraphs Journal of Graph Theory. 85: 706-715 |
| Ferrara M, Jacobson MS, Pfender F, et al. (2016) Graph saturation in multipartite graphs The Journal of Combinatorics. 7: 1-19 |
| De Silva J, Molla T, Pfender F, et al. (2016) Increasing paths in edge-ordered graphs: The hypercube and random graph Electronic Journal of Combinatorics. 23 |
| Balogh J, Hu P, Lidický B, et al. (2016) Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle European Journal of Combinatorics. 52: 47-58 |