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
European Journal of Combinatorics
Topic
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.

219 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.
219 works in the cohort · of 4,299,418page 4 of 5

Labels cover 0 of 219 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 219 of 219 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

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
affno abstractunlabeled
Fast recoloring of sparse graphs
Nicolás Bousquet, Guillem Perarnau
2015· preprint· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Commutation relations and Vandermonde determinants
Yuri Bahturin, Amitai Regev, Doron Zeilberger
2008· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The number of lines in a matroid with no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-minor
Jim Geelen, Peter Nelson
2015· article· lv· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · research_integrity+insufficient_payload
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
afffundno abstractunlabeled
Factorial characters of the classical Lie groups
Angèle M. Foley, Ronald C. King
2018· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Graph homomorphisms via vector colorings
Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, Antonios Varvitsiotis
2019· preprint· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
2
citations
afffundno abstractunlabeled
Forbidden configurations: Boundary cases
R.P. Anstee, Miguel Raggi, Attila Sali
2013· article· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Ramsey-nice families of graphs
Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang +2 more
2018· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Beyond Ohba’s Conjecture: A bound on the choice number of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-chromatic graphs with<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math>vertices
Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu
2014· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow
1
citations
affno abstractunlabeled
Smooth Schubert varieties in the affine flag variety of type <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml16" display="inline" overflow="scroll" altimg="si16.gif"><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mover></mml:math>
Edward Richmond, William Slofstra
2018· article· lv· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrity+insufficient_payloadconsensus · insufficient_payload
1
citations
affno abstractunlabeled
A conjecture of Welsh revisited
Sean McGuinness
2010· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-Free bound for the class of planar graphs
Reza Naserasr
2006· article· lv· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Mixing is hard for triangle-free reflexive graphs
Hyobeen Kim, Jae-baek Lee, Mark Siggers
2023· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Graph sequences sampled from Robinson graphons
Mahya Ghandehari, Jeannette Janssen
2023· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
fundno affno abstractunlabeled
When is a random graph projective?
Tomasz Łuczak, Jaroslav Nešetřil
2006· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Monomial bases for broken circuit complexes
Jason I. Brown, Bruce E. Sagan
2009· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Preface
Youssef Boudabbous, Ivo G. Rosenberg, Nejib Zaguia
2013· article· en· European Journal of Combinatorics
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundno abstractunlabeled
Homomorphisms of random paths
Gábor Kun, Claude Tardif
2009· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On the existence of unparalleled even cycle systems
Peter Danziger, Eric Mendelsohn, Tommaso Traetta
2016· preprint· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Uniform linear embeddings of graphons
Huda Chuangpishit, Mahya Ghandehari, Jeannette Janssen
2016· preprint· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Jump-number of Means on Graphs
Christian Delhommé, Maurice Pouzet, Norbert Sauer
2000· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sparsity of 3-flow-critical graphs
Zdenĕk Dvořák, Sergey Norin
2025· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Additive structure in convex translates
Gabriel Currier, József Solymosi, Ethan Patrick White
2023· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About