On set systems without singleton intersections

Consider a family F of k-subsets of an ambient (k 2 -k + 1)-set such that no pair of k-subsets in F intersects in exactly one element.In this article, it is shown that the maximum size offor every k > 1.

Publication Details

Journal
Discrete Mathematics Letters
Published
2024-12-24
DOI
https://doi.org/10.47443/dml.2024.142
Citations
3
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
1.08

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On set systems without singleton intersections

3 citations
Discrete Mathematics Letters
Polynomial and algebraic computation
1.08
article

On set systems without singleton intersections

article en
3 citations

Abstract

Consider a family F of k-subsets of an ambient (k 2 -k + 1)-set such that no pair of k-subsets in F intersects in exactly one element.In this article, it is shown that the maximum size offor every k > 1.

Discrete Mathematics LettersVol. 14
National Science Foundation
Sustainable cities and communities
Openalex Percentile: Top 19%
Polynomial and algebraic computation
1.08
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On set systems without singleton intersections · Discrete Mathematics Letters (2024) | TGRS Research Map | TGRS