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 1 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.

affno abstractunlabeled
On the number of pentagons in triangle-free graphs
Hamed Hatami, Jan Hladký, Daniel Král͏̌, Serguei Norine, Alexander Razborov
2013· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
164
citations
affno abstractunlabeled
Limits of permutation sequences
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo Moreira, Balázs Ráth, Rudini Sampaio
2012· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
115
citations
affunlabeled
Short Cycles in Random Regular Graphs
Brendan D. McKay, Nicholas Wormald, Beata Wysocka
2004· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
112
citations
afffundno abstractunlabeled
Some New Bounds for Cover-Free Families
Douglas R. Stinson, Ruizhong Wei, Linlin Zhu
2000· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
102
citations
afffundunlabeled
The Number of Labeled 2-Connected Planar Graphs
Edward A. Bender, Zhicheng Gao, Nicholas Wormald
2002· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
89
citations
affunlabeled
Rainbow Turán Problems
Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte
2006· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
78
citations
affno abstractunlabeled
Eigenvalue bounds for independent sets
Chris Godsil, Michael Newman
2008· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
78
citations
afffundunlabeled
Combinatorial batch codes
Maura B. Paterson, Douglas R. Stinson, Ruizhong Wei
2009· article· en· Advances in Mathematics of Communications· Mathematics
machine prediction:candidate · noneconsensus · none
77
citations
affunlabeled
THE CAMERON–ERDOS CONJECTURE
Ben Green
2004· article· en· Bulletin of the London Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
76
citations
affunlabeled
ON THE NUMBER OF SUMS AND PRODUCTS
József Solymosi
2005· article· en· Bulletin of the London Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
76
citations
affno abstractunlabeled
Contributions to zero-sum problems
Sukumar Das Adhikari, Yanhan Chen, John Friedlander, Sergeĭ Konyagin, Francesco Pappalardi
2005· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
63
citations
affno abstractunlabeled
The Ramsey number for hypergraph cycles I
Penny Haxell, Tomasz Łuczak, Yuejian Peng, V. Rödl, Andrzej Ruciński, Miklós Simonovits +1 more
2005· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
62
citations
afffundunlabeled
Encores on Cores
J Cain, Nicholas Wormald
2006· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
55
citations
affunlabeled
Non-Three-Colourable Common Graphs Exist
Hamed Hatami, Jan Hladký, Daniel Král͏̌, Serguei Norine, Alexander Razborov
2012· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
Finitely forcible graphons
László Lovász, Balázs Szegedy
2011· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
On the Turán number for the hexagon
Zoltán Füredi, Assaf Naor, Jacques Verstraëte
2005· article· en· Advances in Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
Rainbow Arithmetic Progressions and Anti-Ramsey Results
Veselin Jungić, Jonathan D. Licht, Mohammad Mahdian, Jaroslav Nešetřil, Radoš Radoičić
2003· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Large Bounded Degree Trees in Expanding Graphs
József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij
2010· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Maxima in hypercubes
Zhidong Bai, Luc Devroye, Hsien‐Kuei Hwang, Tsung‐Hsi Tsai
2005· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Extremal Numbers for Odd Cycles
2014· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Oriented trees in digraphs
Louigi Addario‐Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce Reed, Stéphan Thomassé
2013· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
38
citations
afffundno abstractunlabeled
Two results on the digraph chromatic number
Ararat Harutyunyan, Bojan Mohar
2012· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
The inducibility of blow-up graphs
Hamed Hatami, James Hirst, Serguei Norine
2014· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
37
citations

How this was built: Screen · Findings · About