Balazs Patkos's Papers

2005 2008 2009 2010 2011 2012 2013 2014
Preprints
Manuscripts

TOP
2005

  • B. Patkos,
  • How different can two intersecting families be,
    Electronic Journal of Combinatorics 12 (2005) R24  

    TOP
    2008

  • D. Gerbner, B. Patkos,
  • l-chain profile vectors,
    SIAM Journal on Discrete Mathematics 22 (2008) 1, 185-193.  

    TOP
    2009

  • B. Patkos,
  • The distance of F-free families,
    Studia Sci. Math. Hungarica 46 (2009) 2, 275-286.  
  • D. Gerbner, B. Patkos,
  • Profile vectors in the lattice of subspaces,
    Discrete Mathematics, 309 (2009) 2861-2869.  
  • M. Krivelevich, B. Patkos,
  • Equitable coloring of random graphs,
    Random Structures and Algorithms 35 (2009) 83-99.  
  • B. Patkos,
  • $l$-trace $k$-Spener families,
    J. of Combinatorial Theory, Ser. A, 116 (2009) 1047--1055.  
  • B. Patkos, K. Tichler, G. Wiener
  • Inclusionwise minimal completely separating systems,
    Journal of Statistical Theory and Practice, 3 (2009) 459--466.  
  • B. Patkos,
  • Traces of uniform set families,
    Electronic Journal of Combinatorics, 16 (2009) N8  

    TOP
    2010

  • D. Gerbner, D. Palvolgyi, B. Patkos, G. Wiener,
  • Selecting the largest and the smallest elements with a lie,
    Discrete Applied Mathematics 158, (2010), 988-995.  
  • D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, D. Palvolgyi, B. Patkos,
  • Polychromatic Colorings of Arbitrary Rectangular Partitions,
    Discrete Mathematics 310 (2010), 21--30.  
  • A. Blokhuis, A.E. Brouwer, A. Chowdhury, P. Frankl, T. Mussche, B. Patkos, T. Szonyi
  • Hilton-Milner theorem for vector spaces,
    Electronic Journal of Combinatorics, 17 (2010), R71  
  • A. Chowdhury, B. Patkos,
  • Shadows and Intersections in Vector Spaces,
    J. of Combinatorial Theory, Ser. A 117 (2010) 1095--1106  
  • B. Patkos,
  • On randomly generated non-trivially intersecting hypergraphs,
    Electronic Journal of Combinatorics (17) (2010), R26  

    TOP
    2011

  • P. Balister, B. Patkos,
  • Random partial orders defined by angular domains,
    Order, 28 (2011) 341--355  

    TOP
    2012

  • J. Barat, Z. Furedi, I. Kantor, Y. Kim, B. Patkos,
  • Large $B_d$-free and union-free subfamilies,
    SIAM J. on Discrete Mathematics 26 (2012) 71-76  
  • P.L. Erdos, D. Gerbner, N. Lemons, D. Mubayi, C. Palmer, B. Patkos,
  • Two-part set systems,
    Electronic Journal of Combinatorics, 19 (2012), P52  
  • D. Gerbner, N. Lemons, C. Palmer, B. Patkos, V. Szecsi,
  • Cross-Sperner families,
    Studia Sci. Math. Hungarica, 49 (2012), 44-51.  
  • B. Patkos,
  • A note on traces of set families,
    Moscow Journal of Combinatorics and Number Theory, 2 (2012), 47-55.  
  • D. Gerbner, N. Lemons, C. Palmer, B. Patkos, V. Szecsi
  • Almost intersecting families,
    SIDMA, 26 (2012), 1657-1669.  

    TOP
    2013

  • Z.L. Nagy, L. Ozkahya, B. Patkos, M. Vizer
  • On the ratio of maximum and minimum degree in maximal intersecting families,
    Discrete Mathematics, 313 (2013), 207-211.  
  • B. Patkos,
  • Families that remain k-Sperner even after omitting an element of their ground set,
    Electronic Journal of Combinatorics, 20 (2013), P32  
  • D. Gerbner, G.O.H. Katona, D. Palvolgyi, B. Patkos
  • On majority and plurality problems , slides
    Discrete Applied Mathematics, 161 (2013), 813-818.  
  • I. Kantor, B. Patkos,
  • Towards a de Bruijn-Erdos theorem in the L_1-metric,
    Discrete and Computational Geometry, 49 (2013), 659-670.  
  • D. Gerbner, N. Lemons, C. Palmer, D. Palvolgyi, B. Patkos, V. Szecsi,
  • Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets,
    Graphs and Combinatorics, 29 (2013), 489-498.  
  • D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, D. Palvolgyi, B. Patkos,
  • Saturating Sperner families,
    Graphs and Combinatorics, 29 (2013), 1355-1364.  

    TOP
    2014

  • B. Patkos, M. Vizer
  • Game saturation of intersecting families,
    Cent. Eur. J. Math., 2014, 12(9), 1382-1389

    TOP
    Preprints

  • B. Keszegh, B. Patkos, X. Zhu
  • Nonrepetitive colorings of blow-ups of graphs,
    submitted  
  • A. Grzesik, M. Mikalacki, Z.L. Nagy, A. Naor, B. Patkós, F. Skerman,
  • Avoider-Enforcer star games,
    submitted
  • T. Héger, B. Patkós, M. Takáts
  • Search Problems in Vector Spaces,
    to appear in Designs, Codes and Criptography
  • Y. Kim, M. Kumbhat, Z.L. Nagy, B. Patkós, A. Pokorovskiy, M. Vizer
  • Identifying codes and searching with balls in graphs,
    submitted

    TOP
    Manuscripts

  • P. Balister, B. Bollobas, B. Patkos,
  • Continuum percolations with steps in line segments,
     
  • B. Patkos,
  • AZ-type identities,