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