Sidon sets and graphs without 4-cycles
From MaRDI portal
Publication:477968
DOI10.4310/JOC.2014.v5.n2.a1zbMath1304.05078arXiv1309.6350MaRDI QIDQ477968
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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
11B75: Other combinatorial number theory
Related Items
Upper and lower bounds on the size of $B_k[g$ sets], 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, Extremal digraphs avoiding an orientation of \(C_4\), The number of 4-cycles in a graph, Orthogonal Polarity Graphs and Sidon Sets