MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Limits and Structures in Graph Theory
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

834 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
834 works in the cohort · of 4,299,418page 2 of 17

Labels cover 0 of 834 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 834 of 834 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
On-line Ramsey numbers for paths and stars
Jarosław Grytczuk, H. A. Kierstead, Paweł Prałat
2008· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
34
citations
afffundunlabeled
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
Penny Haxell, Tomasz Łuczak, Yuejian Peng, V. Rödl, Andrzej Ruciński, Jozef Skokan
2009· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Rainbow triangles in three-colored graphs
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young
2017· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Bipartite Ramsey numbers and Zarankiewicz numbers
Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
2000· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Robustness of graph properties
Benny Sudakov
2017· book-chapter· en· Cambridge University Press eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
31
citations
fundno affunlabeled
Conflict-Free Colouring of Graphs
Roman Glebov, Tibor Szabó, Gábor Tardos
2013· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
A Note on Cycle Lengths in Graphs
R.J. Gould, Penny Haxell, Alex Scott
2002· article· en· Graphs and Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Turán numbers of extensions
Sergey Norin, Liana Yepremyan
2017· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
On the chromatic number of random d-regular graphs
Graeme Kemkes, Xavier Pérez‐Giménez, Nicholas Wormald
2009· article· en· Advances in Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Minimal paths and cycles in set systems
Dhruv Mubayi, Jacques Verstraëte
2006· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
On Directed Triangles in Digraphs
Peter Hamburger, Penny Haxell, Alexandr Kostochka
2007· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
25
citations
afffundno abstractunlabeled
A bound on the inducibility of cycles
Daniel Král͏̌, Sergey Norin, Jan Volec
2018· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
A Simple Proof of the Density Hales–Jewett Theorem
Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros
2013· article· en· International Mathematics Research Notices· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Cycles and paths in edge‐colored graphs with given degrees
A. Abouelaoualim, Kinkar Chandra Das, W. Fernandez de la Véga, Marek Karpiński, Yannis Manoussakis, Carlos A. Martinhon +1 more
2009· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Colouring Random 4-Regular Graphs
Lingsheng Shi, Nicholas Wormald
2006· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
venueno affunlabeled
On the Entire Coloring Conjecture
Daniel P. Sanders, Yue Zhao
2000· article· en· Canadian Mathematical Bulletin· Mathematics
machine prediction:candidate · noneconsensus · none
23
citations
aboutno affunlabeled
Ergodic methods in additive combinatorics
Bryna Kra
2007· book-chapter· en· CRM proceedings & lecture notes· Mathematics
machine prediction:candidate · noneconsensus · none
22
citations
fundno affunlabeled
The $t$-Stability Number of a Random Graph
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2010· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
The symmetry preserving removal lemma
Balázs Szegedy
2009· article· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
List Coloring Hypergraphs
Penny Haxell, Jacques Verstraëte
2010· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
On the minimum degree of minimal Ramsey graphs
Tibor Szabó, Philipp Zumstein, Stefanie Zürcher
2009· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
On a Sumset Conjecture of Erdős
Mauro Di Nasso, Isaac Goldbring, Renling Jin, Steven Leth, Martino Lupini, Karl Mahlburg
2014· article· en· Canadian Journal of Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
On the Turán number of ordered forests
Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert
2019· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations

How this was built: Screen · Findings · About