scientific article; zbMATH DE number 3031694

From MaRDI portal
Revision as of 05:09, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5771387

zbMath0020.00504MaRDI QIDQ5771387

No author found.

Publication date: 1938


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (26)

On some extremal problems in graph theoryExtremal results for random discrete structuresThe number of copies of \(K_{2,t+1}\) in a graphSome remarks on the Zarankiewicz problemOn the critical exponent for \(k\)-primitive setsMultiplicative complements IOn sparse parity check matrices (extended abstract)A note on 3‐partite graphs without 4‐cyclesRamsey-type numbers involving graphs and hypergraphs with large girthNew Turán Exponents for Two Extremal Hypergraph ProblemsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsMaximum cardinality neighbourly sets in quadrilateral free graphsOn Erdős and Sárközy's sequences with Property POn some applications of graph theory. I. (Reprint)A generalization of primitive sets and a conjecture of Erd\H{o}sOn the singularity of random symmetric matricesExtremal problems for sets forming Boolean algebras and complete partite hypergraphsHypergraphs in which all disjoint pairs have distinct unionsBounded \(VC\)-dimension implies the Schur-Erdős conjectureHypergraphs with Few Berge Paths of Fixed Length between VerticesAn improved upper bound for the size of the multiplicative 3-Sidon setsTurán numbers of theta graphsNorm-graphs and bipartite Turán numbersUnion-free hypergraphs and probability theoryA new extremal property of Steiner triple-systemsDensity of balanced 3-partite graphs without 3-cycles or 4-cycles







This page was built for publication: