Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
From MaRDI portal
Publication:4655895
DOI10.1017/S0963548303005741zbMath1060.05050OpenAlexW2090526201MaRDI QIDQ4655895
Noga Alon, Michael Krivelevich, Benjamin Sudakov
Publication date: 8 March 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548303005741
Related Items
On 1-subdivisions of transitive tournaments, On explicit constructions of designs, Many Turán exponents via subdivisions, A Folkman Linear Family, The spectral radius of graphs with no intersecting odd cycles, Product representations of polynomials, On the Extremal Number of Subdivisions, The tail is cut for Ramsey numbers of cubes, A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem, Ramsey number of 1-subdivisions of transitive tournaments, Simplicial homeomorphs and trace-bounded hypergraphs, On two problems in graph Ramsey theory, The Turán number of blow-ups of trees, A minimum degree condition forcing complete graph immersion, Disjoint isomorphic balanced clique subdivisions, Tree-Degenerate Graphs and Nested Dependent Random Choice, Clique-factors in graphs with sublinear -independence number, Bipartite Turán problems for ordered graphs, MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS, On low tree-depth decompositions, Maximum cuts and judicious partitions in graphs without short cycles, On Ramsey Size-Linear Graphs and Related Questions, Rainbow clique subdivisions, Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}, Embedding bipartite distance graphs under Hamming metric in finite fields, Unnamed Item, The Turán number of the grid, The bipartite Turán number and spectral extremum for linear forests, Tight bounds for divisible subdivisions, Spectral Turán problems for intersecting even cycles, The structure of almost all graphs in a hereditary property, On the Turán number of the hypercube, Unnamed Item, Ordered Ramsey numbers, Extremal results in sparse pseudorandom graphs, Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz, Subdivisions of digraphs in tournaments, A counterexample to sparse removal, Ramsey numbers of some bipartite graphs versus complete graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Compact topological minors in graphs, More on the extremal number of subdivisions, Two results on Ramsey-Turán theory, Hypergraph Packing and Sparse Bipartite Ramsey Numbers, On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs, Cycle lengths in sparse graphs, A conjecture of Erdős on graph Ramsey numbers, Improved bounds for the extremal number of subdivisions, Testing subgraphs in directed graphs, On the multicolor Ramsey number of a graph with \(m\) edges, Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs, On Ramsey numbers of hedgehogs, BIPARTITE SUBGRAPHS OF -FREE GRAPHS, Bipartite Ramsey numbers involving large \(K_{n,n}\), Two remarks on the Burr-Erdős conjecture, The extremal number of longer subdivisions, Turán Problems and Shadows III: Expansions of Graphs, Geodesic obstacle representation of graphs, Subdivisions of a large clique in \(C_6\)-free graphs, On the Turán Number of the Blow-Up of the Hexagon, Phase transitions in Ramsey-Turán theory
