Find link

language:

Find link is a tool written by Edward Betts.

searching for Combinatorics, Probability and Computing 35 found (91 total)

alternate case: combinatorics, Probability and Computing

Bunkbed conjecture (714 words) [view diff] exact match in snippet view article find links to article

Brightwell concerning random walks on product graphs". Combinatorics, Probability and Computing. 7 (4): 397–401. doi:10.1017/S0963548398003605. Häggström

Random recursive tree (484 words) [view diff] exact match in snippet view article find links to article

(1999), "Total path length for random recursive trees", Combinatorics, Probability and Computing, 8 (4): 317–333, doi:10.1017/S0963548399003855, MR 1723646

Jiří Matoušek (mathematician) (904 words) [view diff] exact match in snippet view article

Topological Methods in Combinatorics and Geometry", Book Review, Combinatorics, Probability and Computing, 13 (2): 281–282, doi:10.1017/S096354830400608X (inactive

Using the Borsuk–Ulam Theorem (530 words) [view diff] exact match in snippet view article find links to article

(March 2004), "Review of Using the Borsuk-Ulam Theorem", Combinatorics, Probability and Computing, 13 (2): 281–282, doi:10.1017/s096354830400608x Kratochvíl

Hedgehog (hypergraph) (204 words) [view diff] exact match in snippet view article

Jacob; Li, Ray (2020), "On Ramsey numbers of hedgehogs", Combinatorics, Probability and Computing, 29 (1): 101–112, arXiv:1902.10221, doi:10.1017/s0963548319000312

Contact graph (483 words) [view diff] exact match in snippet view article find links to article

Rosenstiehl, Pierre (1994), "On triangle contact graphs", Combinatorics, Probability and Computing, 3 (2): 233–246, doi:10.1017/S0963548300001139, MR 1288442

Richard Schelp (261 words) [view diff] exact match in snippet view article find links to article

J. (2012). "My Friend and Colleague, Richard Schelp". Combinatorics, Probability and Computing. 21 (1–2): 1–9. doi:10.1017/S0963548311000630. ISSN 0963-5483

Bipartite realization problem (611 words) [view diff] exact match in snippet view article find links to article

Different Realizations of a Graphical Degree Sequence" (PDF). Combinatorics, Probability and Computing. 22 (3): 366–383. doi:10.1017/S0963548313000096. S2CID 5643528

Grötzsch graph (980 words) [view diff] exact match in snippet view article find links to article

(1999), "On the structure of dense triangle-free graphs", Combinatorics, Probability and Computing, 8 (3): 237–245, doi:10.1017/S0963548399003831, MR 1702550

Alexander Razborov (716 words) [view diff] exact match in snippet view article find links to article

paper "On the minimal density of triangles in graphs" (Combinatorics, Probability and Computing 17 (2008), no. 4, 603–618), and for introducing a new powerful

Strong coloring (581 words) [view diff] exact match in snippet view article find links to article

P. E. (2004-11-01). "On the Strong Chromatic Number". Combinatorics, Probability and Computing. 13 (6): 857–865. doi:10.1017/S0963548304006157. ISSN 0963-5483

László Pyber (677 words) [view diff] exact match in snippet view article find links to article

(1993). "On Random Generation of the Symmetric Group". Combinatorics, Probability and Computing. 2 (4): 505–512. doi:10.1017/S0963548300000869. S2CID 34255045

Noga Alon (1,336 words) [view diff] exact match in snippet view article find links to article

1996. Alon, Noga (1999). "Combinatorial Nullstellensatz". Combinatorics, Probability and Computing. 8 (1–2): 7–29. doi:10.1017/S0963548398003411. MR 1684621

Rainbow-independent set (2,718 words) [view diff] exact match in snippet view article find links to article

HaxellP (2001-07-01). "A Note on Vertex List Colouring". Combinatorics, Probability and Computing. 10 (4): 345–347. doi:10.1017/s0963548301004758. S2CID 123033316

Erdős–Pósa theorem (1,324 words) [view diff] exact match in snippet view article find links to article

"Excluded Forest Minors and the Erdős–Pósa Property". Combinatorics, Probability and Computing. 22 (5): 700–721. arXiv:1204.5192. doi:10.1017/S0963548313000266

AofA—International Meeting on Combinatorial, Probabilistic, and Asymptotic Methods in the Analysis of Algorithms (923 words) [view diff] exact match in snippet view article find links to article

Paris-Jussieu, 14-15-16 December 2011". algo.inria.fr. "Combinatorics, Probability and Computing: Volume 23 - Honouring the Memory of Philippe Flajolet

Waiter–Client game (678 words) [view diff] exact match in snippet view article find links to article

S2CID 7005199. Beck, József (2005). "Positional Games". Combinatorics, Probability and Computing. 14 (5–6): 649–696. doi:10.1017/S0963548305007078. ISSN 1469-2163

Discrepancy game (538 words) [view diff] exact match in snippet view article find links to article

Pikhurko, Oleg; Szabó, Tibor (2005). "The Game of JumbleG". Combinatorics, Probability and Computing. 14 (5–6): 783–793. doi:10.1017/S0963548305006851. ISSN 1469-2163

Planted clique (1,688 words) [view diff] exact match in snippet view article find links to article

hidden cliques in linear time with high probability", Combinatorics, Probability and Computing, 23 (1): 29–49, arXiv:1010.2997, doi:10.1017/S096354831300045X

Alice and Bob (2,023 words) [view diff] exact match in snippet view article find links to article

Winkler, Peter (1992), "Three Thresholds for a Liar", Combinatorics, Probability and Computing, 1 (1): 81–93, doi:10.1017/S0963548300000080, S2CID 45707043

Polynomial method in combinatorics (1,387 words) [view diff] exact match in snippet view article find links to article

2019-12-11. Alon, Noga (1999). "Combinatorial Nullstellensatz". Combinatorics, Probability and Computing. 8 (1–2): 7–29. doi:10.1017/S0963548398003411. ISSN 0963-5483

Quasirandom group (1,803 words) [view diff] exact match in snippet view article find links to article

1006/jcta.1997.2715 Gowers, W.T. (2008), "Quasirandom Groups", Combinatorics, Probability and Computing, 17 (3): 363–387, doi:10.1017/S0963548307008826 Chung,

Dependent random choice (1,757 words) [view diff] exact match in snippet view article find links to article

of Bipartite Graphs and Related Ramsey-Type Questions". Combinatorics, Probability and Computing. 12 (5+6): 477–494. doi:10.1017/S0963548303005741. ISSN 1469-2163

Tournament (graph theory) (2,662 words) [view diff] exact match in snippet view article

"Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments", Combinatorics, Probability and Computing, 6 (3): 255–261, doi:10.1017/S0963548397003027 Bar-Noy

Feedback arc set (6,130 words) [view diff] exact match in snippet view article find links to article

feedback arc set problem is NP-hard for tournaments" (PDF), Combinatorics, Probability and Computing, 16 (1): 1–4, doi:10.1017/S0963548306007887 (inactive 1

Turán's theorem (3,284 words) [view diff] exact match in snippet view article find links to article

"On the minimal density of triangles in graphs" (PDF). Combinatorics, Probability and Computing. 17 (4): 603–618. doi:10.1017/S0963548308009085. S2CID 26524353

Homomorphism density (2,300 words) [view diff] exact match in snippet view article find links to article

"On the minimal density of triangles in graphs" (PDF). Combinatorics, Probability and Computing. 17 (4): 603–618. doi:10.1017/S0963548308009085. S2CID 26524353

Hypergraph removal lemma (2,349 words) [view diff] exact match in snippet view article find links to article

(March 2004). "A Note on a Question of Erdős and Graham". Combinatorics, Probability and Computing. 13 (2): 263–267. doi:10.1017/s0963548303005959. ISSN 0963-5483

Hash table (5,966 words) [view diff] exact match in snippet view article find links to article

the Random Probing Model, With and Without Deletions". Combinatorics, Probability and Computing. 28 (4): 600–617. doi:10.1017/S0963548318000408. S2CID 125374363

Veselin Jungić (1,923 words) [view diff] exact match in snippet view article find links to article

"Rainbow Arithmetic Progressions and Anti-Ramsey Results". Combinatorics, Probability and Computing. 12 (5–6). Cambridge University Press: 599–620. doi:10

Blow-up lemma (2,789 words) [view diff] exact match in snippet view article find links to article

Endre (1995). "Proof of a Packing Conjecture of Bollobás". Combinatorics, Probability and Computing. 4 (3): 241–255. doi:10.1017/S0963548300001620. ISSN 1469-2163

Boltzmann sampler (2,949 words) [view diff] exact match in snippet view article find links to article

for the Random Generation of Combinatorial Structures". Combinatorics, Probability and Computing. 13 (4–5): 577–625. doi:10.1017/S0963548304006315 (inactive

Forbidden subgraph problem (4,298 words) [view diff] exact match in snippet view article find links to article

of bipartite graphs and related Ramsey-type questions". Combinatorics, Probability and Computing. MR 2037065. Füredi, Zoltán; Simonovits, Miklós (2013-06-21)

Configuration model (4,487 words) [view diff] exact match in snippet view article find links to article

Component of a Random Digraph with a Given Degree Sequence". Combinatorics, Probability and Computing. 13 (3): 319–337. doi:10.1017/S096354830400611X. ISSN 1469-2163

Graph removal lemma (5,077 words) [view diff] exact match in snippet view article find links to article

S2CID 6720143. Komlós, János (1999). "The Blow-up Lemma". Combinatorics, Probability and Computing. 8 (1–2): 161–176. doi:10.1017/S0963548398003502. ISSN 1469-2163