Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/cpc/cpc21.bht:"
@article{DBLP:journals/cpc/Addario-BerryMR12, author = {Louigi Addario{-}Berry and Colin McDiarmid and Bruce A. Reed}, title = {Connectivity for Bridge-Addable Monotone Graph Classes}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {803--815}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000272}, doi = {10.1017/S0963548312000272}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Addario-BerryMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Bahmanian12, author = {M. Amin Bahmanian}, title = {Detachments of Hypergraphs {I:} The Berge-Johnson Problem}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {483--495}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000041}, doi = {10.1017/S0963548312000041}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Bahmanian12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BalisterB12, author = {Paul Balister and B{\'{e}}la Bollob{\'{a}}s}, title = {Critical Probabilities of 1-Independent Percolation Models}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {11--22}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000538}, doi = {10.1017/S0963548311000538}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BalisterB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BallP12, author = {Simeon Ball and Valentina Pepe}, title = {Asymptotic Improvements to the Lower Bound of Certain Bipartite Tur{\'{a}}n Numbers}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {323--329}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000423}, doi = {10.1017/S0963548311000423}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BallP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BaloghLS12, author = {J{\'{o}}zsef Balogh and Choongbum Lee and Wojciech Samotij}, title = {Corr{\'{a}}di and Hajnal's Theorem for Sparse Random Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {23--55}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000642}, doi = {10.1017/S0963548311000642}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/BaloghLS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BenevidesLSSW12, author = {Fabr{\'{\i}}cio Siqueira Benevides and Tomasz Luczak and Alex Scott and Jozef Skokan and M. White}, title = {Monochromatic Cycles in 2-Coloured Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {57--87}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000090}, doi = {10.1017/S0963548312000090}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/BenevidesLSSW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BeveridgeDFM12, author = {Andrew Beveridge and Andrzej Dudek and Alan M. Frieze and Tobias M{\"{u}}ller}, title = {Cops and Robbers on Geometric Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {816--834}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000338}, doi = {10.1017/S0963548312000338}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BeveridgeDFM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BhattacharyyaGRS12, author = {Arnab Bhattacharyya and Elena Grigorescu and Prasad Raghavendra and Asaf Shapira}, title = {Testing Odd-Cycle-Freeness in Boolean Functions}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {835--855}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000363}, doi = {10.1017/S0963548312000363}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BhattacharyyaGRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BiluL12, author = {Yonatan Bilu and Nathan Linial}, title = {Are Stable Instances Easy?}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {643--660}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000193}, doi = {10.1017/S0963548312000193}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BiluL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BoehnleinJ12, author = {Edward Boehnlein and Tao Jiang}, title = {Set Families With a Forbidden Induced Subposet}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {496--511}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000028}, doi = {10.1017/S0963548312000028}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BoehnleinJ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BollobasN12, author = {B{\'{e}}la Bollob{\'{a}}s and Vladimir Nikiforov}, title = {Degree Powers in Graphs: The Erd{\H{o}}s-Stone Theorem}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {89--105}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000654}, doi = {10.1017/S0963548311000654}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/BollobasN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BottcherTW12, author = {Julia B{\"{o}}ttcher and Anusch Taraz and Andreas W{\"{u}}rfl}, title = {Perfect Graphs of Fixed Density: Counting and Homogeneous Sets}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {661--682}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000181}, doi = {10.1017/S0963548312000181}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BottcherTW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BousquetT12, author = {Nicolas Bousquet and St{\'{e}}phan Thomass{\'{e}}}, title = {Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {512--514}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000065}, doi = {10.1017/S0963548312000065}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/BousquetT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BrightwellL12, author = {Graham R. Brightwell and Malwina J. Luczak}, title = {Order-Invariant Measures on Fixed Causal Sets}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {330--357}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000721}, doi = {10.1017/S0963548311000721}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BrightwellL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BroutinF12, author = {Nicolas Broutin and Omar Fawzi}, title = {Longest Path Distance in Random Circuits}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {856--881}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000260}, doi = {10.1017/S0963548312000260}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BroutinF12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BukhH12, author = {Boris Bukh and Alfredo Hubard}, title = {Space Crossing Numbers}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {358--373}, year = {2012}, url = {https://doi.org/10.1017/S096354831100040X}, doi = {10.1017/S096354831100040X}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BukhH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/ChanM12, author = {Siu On Chan and Michael Molloy}, title = {(\emph{k}+1)-Cores Have \emph{k}-Factors}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {882--896}, year = {2012}, url = {https://doi.org/10.1017/S096354831200034X}, doi = {10.1017/S096354831200034X}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/ChanM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/ChenRS12, author = {Guantao Chen and Han Ren and Songling Shan}, title = {Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {107--111}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000526}, doi = {10.1017/S0963548311000526}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/ChenRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/ClemensFKL12, author = {Dennis Clemens and Asaf Ferber and Michael Krivelevich and Anita Liebenau}, title = {Fast Strategies In Maker-Breaker Games Played on Random Boards}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {897--915}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000375}, doi = {10.1017/S0963548312000375}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/ClemensFKL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Croot12, author = {Ernie Croot}, title = {Some Properties of Lower Level-Sets of Convolutions}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {515--530}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000119}, doi = {10.1017/S0963548312000119}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Croot12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/CsikvariN12, author = {P{\'{e}}ter Csikv{\'{a}}ri and Zolt{\'{a}}n L{\'{o}}r{\'{a}}nt Nagy}, title = {The Density Tur{\'{a}}n Problem}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {531--553}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000016}, doi = {10.1017/S0963548312000016}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/CsikvariN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Curien12, author = {Nicolas Curien}, title = {Strong Convergence of Partial Match Queries in Random Quadtrees}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {683--694}, year = {2012}, url = {https://doi.org/10.1017/S096354831200017X}, doi = {10.1017/S096354831200017X}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Curien12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/DellamonicaHLMNPRSV12, author = {Domingos Dellamonica Jr. and Penny E. Haxell and Tomasz Luczak and Dhruv Mubayi and Brendan Nagle and Yury Person and Vojtech R{\"{o}}dl and Mathias Schacht and Jacques Verstra{\"{e}}te}, title = {On Even-Degree Subgraphs of Linear Hypergraphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {113--127}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000575}, doi = {10.1017/S0963548311000575}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/DellamonicaHLMNPRSV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/DellamonicaR12, author = {Domingos Dellamonica Jr. and Vojtech R{\"{o}}dl}, title = {Distance Preserving Ramsey Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {554--581}, year = {2012}, url = {https://doi.org/10.1017/S096354831200003X}, doi = {10.1017/S096354831200003X}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/DellamonicaR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/DodosKT12, author = {Pandelis Dodos and Vassilis Kanellopoulos and Konstantinos Tyros}, title = {Measurable Events Indexed by Trees}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {374--411}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000053}, doi = {10.1017/S0963548312000053}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/DodosKT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Even-Zohar12, author = {Chaim Even{-}Zohar}, title = {On Sums of Generating Sets in {\(\mathbb{Z}\)}\({}_{\mbox{2}}\) \({}^{\mbox{ \emph{n} }}\)}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {916--941}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000351}, doi = {10.1017/S0963548312000351}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Even-Zohar12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Faudree12, author = {Ralph J. Faudree}, title = {My Friend and Colleague, Richard Schelp}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {1--9}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000630}, doi = {10.1017/S0963548311000630}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Faudree12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FaudreeGJ12, author = {Ralph J. Faudree and Ronald J. Gould and Michael S. Jacobson}, title = {Minimum Degree and Disjoint Cycles in Claw-Free Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {129--139}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000708}, doi = {10.1017/S0963548311000708}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FaudreeGJ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FranklRR12, author = {Peter Frankl and Vojtech R{\"{o}}dl and Andrzej Rucinski}, title = {On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {141--148}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000496}, doi = {10.1017/S0963548311000496}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/FranklRR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Fuchs12, author = {Michael Fuchs}, title = {Limit Theorems for Subtree Size Profiles of Increasing Trees}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {412--441}, year = {2012}, url = {https://doi.org/10.1017/S096354831100071X}, doi = {10.1017/S096354831100071X}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Fuchs12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FujisawaS12, author = {Jun Fujisawa and Akira Saito}, title = {A Pair of Forbidden Subgraphs and 2-Factors}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {149--158}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000514}, doi = {10.1017/S0963548311000514}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FujisawaS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Furedi12, author = {Zolt{\'{a}}n F{\"{u}}redi}, title = {2-Cancellative Hypergraphs and Codes}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {159--177}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000563}, doi = {10.1017/S0963548311000563}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Furedi12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/GeS12, author = {Qi Ge and Daniel Stefankovic}, title = {A Graph Polynomial for Independent Sets of Bipartite Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {695--714}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000296}, doi = {10.1017/S0963548312000296}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/GeS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/GirardGH12, author = {Benjamin Girard and Simon Griffiths and Yahya Ould Hamidoune}, title = {\emph{k}-Sums in Abelian Groups}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {582--596}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000168}, doi = {10.1017/S0963548312000168}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/GirardGH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/GnedinIM12, author = {Alexander V. Gnedin and Alexander Iksanov and Alexander Marynych}, title = {A Generalization of the Erd{\H{o}}s-Tur{\'{a}}n Law for the Order of Random Permutation}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {715--733}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000247}, doi = {10.1017/S0963548312000247}, timestamp = {Thu, 06 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/GnedinIM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Green12, author = {Ben Green}, title = {On (Not) Computing the M{\"{o}}bius Function Using Bounded Depth Circuits}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {942--951}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000284}, doi = {10.1017/S0963548312000284}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/Green12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/GyarfasS12, author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy}, title = {Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {179--186}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000599}, doi = {10.1017/S0963548311000599}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/GyarfasS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/GyoriL12, author = {Ervin Gy{\"{o}}ri and Hao Li}, title = {The Maximum Number of Triangles in \emph{C}\({}_{\mbox{2\emph{k}+1}}\)-Free Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {187--191}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000629}, doi = {10.1017/S0963548311000629}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/GyoriL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/GyoriL12a, author = {Ervin Gy{\"{o}}ri and Nathan Lemons}, title = {Hypergraphs with No Cycle of a Given Length}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {193--201}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000691}, doi = {10.1017/S0963548311000691}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/GyoriL12a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/HatamiHKNR12, author = {Hamed Hatami and Jan Hladk{\'{y}} and Daniel Kr{\'{a}}l' and Serguei Norine and Alexander A. Razborov}, title = {Non-Three-Colourable Common Graphs Exist}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {734--742}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000107}, doi = {10.1017/S0963548312000107}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/HatamiHKNR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/HoppenKL12, author = {Carlos Hoppen and Yoshiharu Kohayakawa and Hanno Lefmann}, title = {Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {203--218}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000484}, doi = {10.1017/S0963548311000484}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/HoppenKL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/HuangLS12, author = {Hao Huang and Po{-}Shen Loh and Benny Sudakov}, title = {The Size of a Hypergraph and its Matching Number}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {442--450}, year = {2012}, url = {https://doi.org/10.1017/S096354831100068X}, doi = {10.1017/S096354831100068X}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/HuangLS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KaplanMSS12, author = {Haim Kaplan and Jir{\'{\i}} Matousek and Zuzana Safernov{\'{a}} and Micha Sharir}, title = {Unit Distances in Three Dimensions}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {597--610}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000144}, doi = {10.1017/S0963548312000144}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KaplanMSS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KatonaKK12, author = {Gyula O. H. Katona and Gyula Y. Katona and Zsolt Katona}, title = {Most Probably Intersecting Families of Subsets}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {219--227}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000587}, doi = {10.1017/S0963548311000587}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KatonaKK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashM12, author = {Peter Keevash and Dhruv Mubayi}, title = {The Tur{\'{a}}n Number of \emph{F}\({}_{\mbox{3, 3}}\)}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {451--456}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000678}, doi = {10.1017/S0963548311000678}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KeevashM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KinnersleyMW12, author = {William B. Kinnersley and Kevin G. Milans and Douglas B. West}, title = {Degree Ramsey Numbers of Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {229--253}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000617}, doi = {10.1017/S0963548311000617}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KinnersleyMW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KostochkaKL12, author = {Alexandr V. Kostochka and Mohit Kumbhat and Tomasz Luczak}, title = {Conflict-Free Colourings of Uniform Hypergraphs With Few Edges}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {611--622}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000156}, doi = {10.1017/S0963548312000156}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/KostochkaKL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KostochkaY12, author = {Alexandr V. Kostochka and Matthew P. Yancey}, title = {Large Rainbow Matchings in Edge-Coloured Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {255--263}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000605}, doi = {10.1017/S0963548311000605}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KostochkaY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Kotek12, author = {Tomer Kotek}, title = {Complexity of Ising Polynomials}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {743--772}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000259}, doi = {10.1017/S0963548312000259}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Kotek12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/LeeSV12, author = {Choongbum Lee and Benny Sudakov and Dan Vilenchik}, title = {Getting a Directed Hamilton Cycle Two Times Faster}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {5}, pages = {773--801}, year = {2012}, url = {https://doi.org/10.1017/S096354831200020X}, doi = {10.1017/S096354831200020X}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/LeeSV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Lo12, author = {Allan Lo}, title = {Cliques in Graphs With Bounded Minimum Degree}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {457--482}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000745}, doi = {10.1017/S0963548311000745}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Lo12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Naor12, author = {Assaf Naor}, title = {On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon-Roichman Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {623--634}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000757}, doi = {10.1017/S0963548311000757}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Naor12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Riordan12, author = {Oliver Riordan}, title = {The Phase Transition in the Configuration Model}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {265--299}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000666}, doi = {10.1017/S0963548311000666}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Riordan12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Russell12, author = {Paul A. Russell}, title = {Compressions and Probably Intersecting Families}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {301--313}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000472}, doi = {10.1017/S0963548311000472}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Russell12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/SaxtonT12, author = {David Saxton and Andrew Thomason}, title = {List Colourings of Regular Hypergraphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {1-2}, pages = {315--322}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000502}, doi = {10.1017/S0963548311000502}, timestamp = {Wed, 03 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/SaxtonT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Timar12, author = {{\'{A}}d{\'{a}}m Tim{\'{a}}r}, title = {Approximating Cayley Diagrams Versus Cayley Graphs}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {4}, pages = {635--641}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000733}, doi = {10.1017/S0963548311000733}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Timar12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Yuster12, author = {Raphael Yuster}, title = {Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {6}, pages = {952--962}, year = {2012}, url = {https://doi.org/10.1017/S0963548312000235}, doi = {10.1017/S0963548312000235}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Yuster12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.