Sidon sets and graphs without 4-cycles

DOI10.4310/JOC.2014.v5.n2.a1zbMath1304.05078arXiv1309.6350OpenAlexW2962886144MaRDI QIDQ477968

Michael Tait, Craig Timmons

Publication date: 10 December 2014

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6350

zbMATH Keywords

4-cycleTurán numberSidon set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Other combinatorial number theory (11B75)

Related Items (6)

Upper and lower bounds on the size of $B_k[g$ sets] ⋮ The number of 4-cycles in a graph ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints ⋮ Orthogonal Polarity Graphs and Sidon Sets ⋮ Extremal digraphs avoiding an orientation of \(C_4\)

This page was built for publication: Sidon sets and graphs without 4-cycles