• 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 48 matches

• 2020
• 
  Meysam Alishahi, Hossein Hajiabolhassan:
  On the Chromatic Number of Matching Kneser Graphs. Comb. Probab. Comput. 29(1): 1-21 (2020)
• 
  Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn:
  Edge-statistics on large graphs. Comb. Probab. Comput. 29(2): 163-189 (2020)
• 
  Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion:
  Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29(1): 22-30 (2020)
• 
  Omer Angel, Abbas Mehrabian, Yuval Peres:
  The string of diamonds is nearly tight for rumour spreading. Comb. Probab. Comput. 29(2): 190-199 (2020)
• 
  Simeon Ball, Bence Csajbók:
  On sets of points with few odd secants. Comb. Probab. Comput. 29(1): 31-43 (2020)
• 
  Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko:
  Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29(1): 44-67 (2020)
• 
  Patrick Bennett, Andrzej Dudek, Shira Zerbib:
  Large triangle packings and Tuza's conjecture in sparse random graphs. Comb. Probab. Comput. 29(5): 757-779 (2020)
• 
  Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov:
  Monochromatic trees in random tournaments. Comb. Probab. Comput. 29(3): 318-345 (2020)
• 
  Boris Bukh, Michael Tait:
  Turán numbers of theta graphs. Comb. Probab. Comput. 29(4): 495-507 (2020)
• 
  Michael C. H. Choi, Pierre Patie:
  Analysis of non-reversible Markov chains via similarity orbits. Comb. Probab. Comput. 29(4): 508-536 (2020)
• 
  Dennis Clemens, Anita Liebenau, Damian Reding:
  On minimal Ramsey graphs and Ramsey equivalence in multiple colours. Comb. Probab. Comput. 29(4): 537-554 (2020)
• 
  Amin Coja-Oghlan, Tobias Kapetanopoulos, Noëla Müller:
  The replica symmetric phase of random constraint satisfaction problems. Comb. Probab. Comput. 29(3): 346-422 (2020)
• 
  Gabriel Conant:
  On finite sets of small tripling or small alternation in arbitrary groups. Comb. Probab. Comput. 29(6): 807-829 (2020)
• 
  Shagnik Das, Andrew Treglown:
  Ramsey properties of randomly perturbed graphs: cliques and cycles. Comb. Probab. Comput. 29(6): 830-867 (2020)
• 
  Charilaos Efthymiou:
  Deterministic counting of graph colourings using sequences of subgraphs. Comb. Probab. Comput. 29(4): 555-586 (2020)
• 
  Stefan Ehard, Stefan Glock, Felix Joos:
  Pseudorandom hypergraph matchings. Comb. Probab. Comput. 29(6): 868-885 (2020)
• 
  Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora:
  Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. Comb. Probab. Comput. 29(3): 423-435 (2020)
• 
  Lorenzo Federico, Remco van der Hofstad, Frank Den Hollander, Tim Hulshof:
  Expansion of Percolation Critical Points for Hamming Graphs. Comb. Probab. Comput. 29(1): 68-100 (2020)
• 
  Asaf Ferber, Asaf Shapira:
  A quantitative Lovász criterion for Property B. Comb. Probab. Comput. 29(6): 956-960 (2020)
• 
  Yuval Filmus:
  FKN theorem for the multislice, with applications. Comb. Probab. Comput. 29(2): 200-212 (2020)
• 
  Jacob Fox, Ray Li:
  On Ramsey numbers of hedgehogs. Comb. Probab. Comput. 29(1): 101-112 (2020)
• 
  Agelos Georgakopoulos, John Haslegrave:
  Percolation on an infinitely generated group. Comb. Probab. Comput. 29(4): 587-615 (2020)
• 
  Alessandra Graf, Penny Haxell:
  Finding independent transversals efficiently. Comb. Probab. Comput. 29(5): 780-806 (2020)
• 
  Sam Greenberg, Dana Randall, Amanda Pascoe Streib:
  Sampling biased monotonic surfaces using exponential metrics. Comb. Probab. Comput. 29(5): 672-697 (2020)
• 
  Dániel Grósz, Abhishek Methuku, Casey Tompkins:
  On subgraphs of C2k-free graphs and a problem of Kühn and Osthus. Comb. Probab. Comput. 29(3): 436-454 (2020)
• 
  Michael Haythorpe, Alex Newcombe:
  Constructing families of cospectral regular graphs. Comb. Probab. Comput. 29(5): 664-671 (2020)
• 
  Annika Heckel:
  Sharp concentration of the equitable chromatic number of dense random graphs. Comb. Probab. Comput. 29(2): 213-233 (2020)
• 
  Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
  Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29(4): 616-632 (2020)
• 
  Tao Jiang, Liana Yepremyan:
  Supersaturation of even linear cycles in linear hypergraphs. Comb. Probab. Comput. 29(5): 698-721 (2020)
• 
  Emma Yu Jin, Benedikt Stufler:
  Graph limits of random unlabelled k-trees. Comb. Probab. Comput. 29(5): 722-746 (2020)

skipping 18 more matches