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

afffundunlabeled
A Lower Bound on the Average Degree Forcing a Minor
Sergey Norin, Bruce Reed, Andrew Thomason, David R. Wood
2020· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Distance edge-colourings and matchings
Ross J. Kang, Putra Manggala
2012· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Trees with depression three
Christina M. Mynhardt
2007· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Regularity, uniformity, and quasirandomness
József Solymosi
2005· letter· en· Proceedings of the National Academy of Sciences· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Linear cover time is exponentially unlikely
Itaï Benjamini, Ori Gurel-Gurevich, Ben Morris
2011· article· en· Probability Theory and Related Fields· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Counting unrooted maps on the plane
Valery A. Liskovets, Timothy R. Walsh
2005· article· en· Advances in Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Independent Deuber sets in graphs on the natural numbers
David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtěch Rödl
2003· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
The chromatic Ramsey number of odd wheels
Nathalie Paul, Claude Tardif
2011· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Product representations of polynomials
Jacques Verstraëte
2006· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Towards a characterization of Sidorenko systems
Nina Kamčev, Anita Liebenau, Natasha Morrison
2023· article· en· The Quarterly Journal of Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Graph properties, graph limits, and entropy
Hamed Hatami, Svante Janson, Balázs Szegedy
2017· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Rainbow Arborescence in Random Digraphs
Deepak Bal, Patrick Bennett, Colin Cooper, Alan Frieze, Paweł Prałat
2015· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Logarithmic Concavity and sl2(C)
David G. Wagner
2001· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
venueno affno abstractunlabeled
On bipartite generalized Ramsey theory.
Gábor N. Sárközy, Stanley M. Selkow
2003· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Variations on the Roy-Gallai theorem
D. de Werra, Pierre Hansen
2005· article· en· 4OR· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
On the chromatic number of a random 5‐regular graph
Josep Dı́az, Alexis C. Kaporis, Graeme Kemkes, Lefteris M. Kirousis, N. C. Wormald
2009· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Estimating the maximum
Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
2004· article· en· Journal of Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Introduction
Richard K. Guy
2004· book-chapter· en· Problem books in mathematics· Mathematics
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
5
citations
afffundunlabeled
Edge clique covers in graphs with independence number two
Pierre Charbit, Geňa Hahn, Marcin Kamiński, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr +2 more
2021· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Counterexamples to a Conjecture of Harris on Hall Ratio
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
2022· article· en· SIAM Journal on Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Intersecting families of sets are typically trivial
József Balogh, Ramon I. Garcia, Lina Li, Adam Zsolt Wagner
2023· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
fundno affno abstractunlabeled
Packing A-paths of length zero modulo a prime
Robin Thomas, Youngho Yoo
2023· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About