On the Turán Number of the G3×3 in Linear Hypergraphs

ABSTRACT We construct dense 3‐uniform linear hypergraphs without grids. This improves the known lower bound for their Turán number. We also discuss some related problems.

Authors

Institutions

Publication Details

Journal
Journal of Graph Theory
Published
2026-10-14
DOI
https://doi.org/10.1002/jgt.70148
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

On the Turán Number of the G3×3 in Linear Hypergraphs

József Solymosi
Journal of Graph Theory
Limits and Structures in Graph Theory
article

On the Turán Number of the G3×3 in Linear Hypergraphs

József Solymosi
article en

Abstract

ABSTRACT We construct dense 3‐uniform linear hypergraphs without grids. This improves the known lower bound for their Turán number. We also discuss some related problems.

Journal of Graph Theory
Obuda University (HU), University of British Columbia (CA)
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 5%
Limits and Structures in Graph Theory
DOISourceOpenAlex
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.