MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 9 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Chromatic numbers and products
Dwight Duffus, N. Sauer
2005· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
The extremal function for disconnected minors
Endre Csóka, Irene Lo, Sergey Norin, Hehui Wu, Liana Yepremyan
2017· preprint· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · stsconsensus · none
3
citations
affno abstractunlabeled
The well-covered dimension of random graphs
Jason I. Brown, Richard J. Nowakowski
2006· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
aboutno affno abstractunlabeled
Hypergraphs with a Quarter Uniform Turán Density
Li Hao, Hao Lin, Guanghui Wang, Wenling Zhou
2025· article· en· Journal of the Operations Research Society of China· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Tools for counting odd cycles in graphs
Donovan R. Hare
2019· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
ON DAVENPORT'S CONSTANT
Purusottam Rath, K. Srilakshmi, R. Thangadurai
2008· article· en· International Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
afffundunlabeled
Limits of Boolean Functions on $\mathbb{F}_p^n$
Hamed Hatami, Pooya Hatami, James Hirst
2014· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Tight Hamilton cycles with high discrepancy
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia
2025· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Off-Diagonal Commonality of Graphs via Entropy
Natalie Behague, Natasha Morrison, Jonathan A. Noel
2024· article· en· SIAM Journal on Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Ramsey Number of Wheels Versus Cycles and Trees
Ghaffar Raeisi, Ali Zaghian
2015· article· en· Canadian Mathematical Bulletin· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
Small maximally disjoint union-free families
Peter J. Dukes, Lea Howard
2007· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Finding modes with equality comparisons
J. Ian Munro, Venkatesh Raman, Srinivas Rao Satti
2017· article· en· Theoretical Computer Science· Mathematics
distilled prediction:candidate · stsconsensus · sts
3
citations
affvenueunlabeled
The Shifted Turán Sieve Method on Tournaments
Wentang Kuo, Yu-Ru Liu, Sávio Ribas, Kevin Zheng Zhou
2019· article· en· Canadian Mathematical Bulletin· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
affno abstractunlabeled
Structure in sparse k-critical graphs
Ronald J. Gould, Victor Larsen, Luke Postle
2022· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affunlabeled
Kissing numbers of regular graphs
Maxime Fortier Bourque, Bram Petri
2019· article· en· ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Maximum number of colourings: 4-chromatic graphs
Fiachra Knox, Bojan Mohar
2020· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
A rainbow version of Mantel's Theorem
Ron Aharoni, Matt DeVos, Sebastián González Hermosillo de la Maza, Amanda Montejano, Robert Šámal
2018· preprint· en· arXiv (Cornell University)· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Interval Minors of Complete Bipartite Graphs
Bojan Mohar, Arash Rafiey, B. Tayfeh‐Rezaie, Hehui Wu
2015· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
On distance edge-colourings and matchings
Ross J. Kang, Putra Manggala
2009· article· en· Electronic Notes in Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Rainbow Hamilton cycles and lopsidependency
Nicholas C. Harvey, Christopher Liaw
2017· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Weak diameter coloring of graphs on surfaces
Zdenĕk Dvořák, Sergey Norin
2023· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
On the intersection density of the Kneser graph <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2044" altimg="si19.svg"> <mml:mrow> <mml:mi>K</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math>
Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra
2023· article· lv· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
2
citations
affunlabeled
Independent sets in association schemes
Chris Godsil, Michael Newman
2003· preprint· en· ArXiv.org· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Weighted Ramsey problem
Jun Fujisawa, Katsuhiro Ota
2006· article· en· The Australasian Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The quasi order of graphs on an ordinal
Péter Komjáth, Jean A. Larson, Norbert Sauer
2011· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Cycles in graphs of fixed girth with large size
József Solymosi, Ching Wong
2017· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Connectivity of inhomogeneous random graphs
Luc Devroye, Nicolás Fraiman
2012· preprint· en· arXiv (Cornell University)· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundunlabeled
Tight Bounds on the Clique Chromatic Number
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
2021· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About