MétaCan
Menu
Back to cohort
Record W4389591199 · doi:10.1016/j.ejc.2023.103910

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>

2023· article· lv· W4389591199 on OpenAlexafffund
Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra

Bibliographic record

VenueEuropean Journal of Combinatorics · 2023
Typearticle
Languagelv
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsUniversity of Regina
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCombinatoricsMathematicsAutomorphismAutomorphism groupVertex (graph theory)GraphIntersection (aeronautics)Discrete mathematics

Abstract

fetched live from OpenAlex

A set F⊂Sym(V) is intersecting if any two of its elements agree on some element of V. Given a finite transitive permutation group G≤Sym(V), the intersection density ρ(G) is the maximum ratio |F||V||G| where F runs through all intersecting sets of G. The intersection density ρ(X) of a vertex-transitive graph X=(V,E) is equal to maxρ(G):G≤Aut(X),G transitive. In this paper, we study the intersection density of the Kneser graph K(n,3), for n≥7. The intersection density of K(n,3) is determined whenever its automorphism group contains PSL2(q), with some exceptional cases depending on the congruence of q. We also briefly consider the intersection density of K(n,2) for values of n where PSL2(q) is a subgroup of its automorphism group.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.005
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication, Open science, Research integrity, Insufficient payload (model declined to judge)
Consensus categoriesMeta-epidemiology (narrow), Science and technology studies, Research integrity, Insufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.853
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0080.005
Meta-epidemiology (narrow)0.0020.003
Meta-epidemiology (broad)0.0010.004
Bibliometrics0.0010.003
Science and technology studies0.0040.003
Scholarly communication0.0020.002
Open science0.0050.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0270.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.020
GPT teacher head0.238
Teacher spread0.218 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; both teacher heads agree on what is shown here.

Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueEuropean Journal of CombinatoricsSame topicLimits and Structures in Graph TheoryFrench-language works237,207