scientific article
From MaRDI portal
Publication:3679225
zbMath0565.05042MaRDI QIDQ3679225
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ Non-bipartite \(k\)-common graphs ⋮ The number of copies of \(K_{2,t+1}\) in a graph ⋮ Color the cycles ⋮ The number of 4-cycles in a graph ⋮ The Turán number of blow-ups of trees ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ Toward characterizing locally common graphs ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ On even-cycle-free subgraphs of the hypercube ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ On even-cycle-free subgraphs of the doubled Johnson graphs ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ Two approaches to Sidorenko’s conjecture ⋮ Some extremal results on 4-cycles ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph
This page was built for publication:
