• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 45 matches

• 2024
• 
  Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer:
  Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. 118: 103930 (2024)
• 
  Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
  Some exact results for regular Turán problems for all large orders. Eur. J. Comb. 117: 103828 (2024)
• 2023
• 
  Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
  On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023)
• 
  Dániel Gerbner, Dániel Lenger, Máté Vizer:
  A plurality problem with three colors and query size three. Discret. Math. 346(1): 113151 (2023)
• 
  Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer:
  Turán problems for edge-ordered graphs. J. Comb. Theory B 160: 66-113 (2023)
• 2022
• 
  Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  Forbidden subposet problems in the grid. Discret. Math. 345(3): 112720 (2022)
• 
  Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer:
  Unified approach to the generalized Turán problem and supersaturation. Discret. Math. 345(3): 112743 (2022)
• 
  Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
  Saturation problems with regularity constraints. Discret. Math. 345(8): 112921 (2022)
• 
  Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
  Singular Turán numbers and WORM-colorings. Discuss. Math. Graph Theory 42(4): 1061-1074 (2022)
• 
  Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
  On saturation of Berge hypergraphs. Eur. J. Comb. 102: 103477 (2022)
• 
  Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  Rainbow Ramsey Problems for the Boolean Lattice. Order 39(3): 453-463 (2022)
• 2021
• 
  Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. Electron. J. Comb. 28(1): 1 (2021)
• 
  Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
  Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021)
• 
  Dániel Gerbner, Máté Vizer:
  On non-adaptive majority problems of large query size. Discret. Math. Theor. Comput. Sci. 23(3) (2021)
• 
  Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  On the maximum number of copies of H in graphs with given size and order. J. Graph Theory 96(1): 34-43 (2021)
• 2020
• 
  Máté Vizer, Dániel Gerbner:
  Smart elements in combinatorial group testing problems with more defectives. Art Discret. Appl. Math. 3(2) (2020)
• 
  Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer:
  On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276: 19-23 (2020)
• 
  Dániel Gerbner, Máté Vizer:
  Rounds in a combinatorial search problem. Discret. Appl. Math. 276: 60-68 (2020)
• 
  Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer:
  Generalized Turán problems for even cycles. J. Comb. Theory B 145: 169-213 (2020)
• 
  Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer:
  Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34(1): 351-369 (2020)
• 
  Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. 34(3): 1813-1829 (2020)
• 2019
• 
  Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  Stability Results for Vertex Turán Problems in Kneser Graphs. Electron. J. Comb. 26(2): 2 (2019)
• 
  Dániel Gerbner, Máté Vizer:
  Majority problems of large query size. Discret. Appl. Math. 254: 124-134 (2019)
• 
  Dániel Gerbner, Abhishek Methuku, Máté Vizer:
  Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342(11): 3130-3141 (2019)
• 
  Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  On the Number of Containments in P-free Families. Graphs Comb. 35(6): 1519-1540 (2019)
• 
  Dániel Gerbner, Abhishek Methuku, Máté Vizer:
  Asymptotics for the Turán number of Berge-K_{2, t}. J. Comb. Theory B 137: 264-290 (2019)
• 
  Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer:
  An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91(1): 88-97 (2019)
• 
  Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
  Forbidding Rank-Preserving Copies of a Poset. Order 36(3): 611-620 (2019)
• 
  Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
  Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019)
• 2018
• 
  Dániel Gerbner, Balázs Patkós, Máté Vizer:
  Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. 25(3): 3 (2018)

skipping 15 more matches