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

afffundno abstractunlabeled
Adaptable chromatic number of graph products
Pavol Hell, Zhishi Pan, Tsai–Lien Wong, Xuding Zhu
2009· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
On the Chromatic Thresholds of Hypergraphs
József Balogh, Jane Butterfield, Ping Hu, John Lenz, Dhruv Mubayi
2015· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Tilings in vertex ordered graphs
József Balogh, Lina Li, Andrew Treglown
2022· article· en· University of Birmingham Research Portal (University of Birmingham)· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Sperner Partition Systems
P. C. Li, Karen Meagher
2012· article· en· Journal of Combinatorial Designs· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Unavoidable cycle lengths in graphs
Jacques Verstraëte
2005· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Halfway to Hadwiger's Conjecture
Luke Postle
2019· preprint· en· arXiv (Cornell University)· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Extremal sequences of polynomial complexity
Kevin G. Hare, Ian D. Morris, Nikita Sidorov
2013· article· en· Mathematical Proceedings of the Cambridge Philosophical Society· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
On highly ramsey infinite graphs
Mark Siggers
2008· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A Ramsey‐type problem and the Turán numbers*
Noga Alon, P. Erdös, David S. Gunderson, Michael Molloy
2002· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Every graph is eventually Turán-good
Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek
2023· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
fundno affno abstractunlabeled
Davenport constant for commutative rings
Calvin Deng
2016· article· en· Journal of Number Theory· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On the edge-density of 4-critical graphs
Babak Farzad, Michael Molloy
2009· article· en· COMBINATORICA· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A new framework to approach Vizing's conjecture
Boštjan Brešar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall
2020· article· en· Discussiones Mathematicae Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Linear embeddings of graphs and graph limits
Huda Chuangpishit, Mahya Ghandehari, Matthew Hurshman, Jeannette Janssen, Nauzer Kalyaniwalla
2015· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Graph properties, graph limits and entropy
Hamed Hatami, Svante Janson, Balázs Szegedy
2013· preprint· en· Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Clique coloring of binomial random graphs
Colin McDiarmid, Dieter Mitsche, Paweł Prałat
2018· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
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
afffundno abstractunlabeled
From One to Many Rainbow Hamiltonian Cycles
Peter Bradshaw, Kevin Halasz, Ladislav Stacho
2022· article· en· Graphs and Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About