The History of Degenerate (Bipartite) Extremal Graph Problems
From MaRDI portal
Publication:5416078
DOI10.1007/978-3-642-39286-3_7zbMath1296.05098arXiv1306.5167OpenAlexW2155085924MaRDI QIDQ5416078
Miklós Simmonovits, Zoltan Fueredi
Publication date: 19 May 2014
Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5167
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Many Turán exponents via subdivisions, Universal and unavoidable graphs, On Turán exponents of bipartite graphs, Counting H-free orientations of graphs, The Generalized Rainbow Turán Problem for Cycles, Turán theorems for unavoidable patterns, On the Extremal Number of Subdivisions, A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem, Simplicial homeomorphs and trace-bounded hypergraphs, The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size, Tree-Degenerate Graphs and Nested Dependent Random Choice, On a generalization of the spectral Mantel's theorem, Unavoidable chromatic patterns in 2‐colorings of the complete graph, Generalized Turán results for intersecting cliques, Outerplanar Turán numbers of cycles and paths, Spectral extremal graphs for the bowtie, Turán numbers for disjoint paths, On the maximum number of odd cycles in graphs without smaller odd cycles, A stability result for girth‐regular graphs with even girth, A Spectral Erdős-Sós Theorem, Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size, Exact bipartite Turán numbers of large even cycles, Counting hypergraphs with large girth, Refinement on Spectral Turán’s Theorem, Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls, Bipartite-ness under smooth conditions, Upper bounds on the extremal number of the 4‐cycle, An \(A_\alpha\)-spectral Erdős-Pósa theorem, The Number of Cliques in Graphs Covered by Long Cycles, On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles, Extremal absorbing sets in low-density parity-check codes, Extremal bipartite independence number and balanced coloring, A Result on Polynomials Derived Via Graph Theory, Rainbow Saturation for Complete Graphs, Spectral radius of graphs of given size with forbidden subgraphs, Random polynomial graphs for random Turán problems, Four-vertex traces of finite sets, On girth-biregular graphs, On the Turán Number of Generalized Theta Graphs, Finding Cliques in Social Networks: A New Distribution-Free Model, The Ramsey number of a long even cycle versus a star, Random multilinear maps and the Erd\H{o}s box problem, The Turán number of the grid, The bipartite Turán number and spectral extremum for linear forests, Spectral Turán problems for intersecting even cycles, A spectral extremal problem on non-bipartite triangle-free graphs, Spectral extremal problem on disjoint color-critical graphs, Recent progress towards Hadwiger's conjecture, An \(A_{\alpha}\)-spectral Erdős-Sós theorem, Stability of extremal connected hypergraphs avoiding Berge-paths, Extremal numbers of hypergraph suspensions of even cycles, Extremal Numbers for Odd Cycles, A Bound on the Number of Edges in Graphs Without an Even Cycle, Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree, Unnamed Item, Induced Turán Numbers, A proof for a conjecture of Gorgol, Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\), Turán Numbers of Bipartite Subdivisions, Extensions of the Erdős–Gallai theorem and Luo’s theorem, Hypergraphs with Few Berge Paths of Fixed Length between Vertices, Supersaturation of even linear cycles in linear hypergraphs, Bipartite Independence Number in Graphs with Bounded Maximum Degree, Turán numbers of theta graphs, Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, Spectral extremal graphs for intersecting cliques, Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko, Remarks on an edge-coloring problem, The number of \(C_{2\ell}\)-free graphs, Degenerate Turán problems for hereditary properties, The Turán number of disjoint copies of paths, The spectral radius of graphs with no intersecting odd cycles, Generalized rainbow Turán problems, Multicolor Turán numbers, Sublinear-time distributed algorithms for detecting small cliques and even cycles, Stability in the Erdős-Gallai theorems on cycles and paths, Singular Turán numbers and worm-colorings, On small balanceable, strongly-balanceable and omnitonal graphs, Some extremal results on hypergraph Turán problems, Small cores in 3-uniform hypergraphs, Proof of a conjecture on monomial graphs, On the Turán number of some ordered even cycles, Ordering the maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter, The spectral Turán problem about graphs with no 6-cycle, Lower Bounds for Subgraph Detection in the CONGEST Model, Extremal graphs for edge blow-up of graphs, Splits with forbidden subgraphs, Vertex Turán problems for the oriented hypercube, Some extremal results on complete degenerate hypergraphs, The maximum number of cliques in graphs without long cycles, On the hat guessing number of a planar graph class, The Turán number of blow-ups of trees, Graphs with large maximum degree containing no edge-critical graphs, Packing two graphs of even girth 10, Inverting the Turán problem, Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets, On a conjecture of spectral extremal problems, The minimum number of clique-saturating edges, The maximum spectral radius of graphs without spanning linear forests, Linearity of saturation for Berge hypergraphs, Small Dense Subgraphs of a Graph, A Rainbow Erdös--Rothschild Problem, Generalized Turán problems for even cycles, Stability of Woodall's theorem and spectral conditions for large cycles, The balancing number and generalized balancing number of some graph classes, Turán problems for edge-ordered graphs, The Zero Forcing Number of Graphs, Stability in the Erdős-Gallai theorem on cycles and paths. II, Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor, The maximum spectral radius of graphs without friendship subgraphs, The \(Q_2\)-free process in the hypercube, Extremal problems on distance spectra of graphs, Edges not in any monochromatic copy of a fixed graph, Decomposition of bounded degree graphs into \(C_4\)-free subgraphs, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, On induced saturation for paths, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Large cliques in hypergraphs with forbidden substructures, Extremal Graphs with Local Covering Conditions, Ramsey Goodness of Bounded Degree Trees, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, More on the extremal number of subdivisions, The spectral radius of graphs with no odd wheels, Linear Turán numbers of acyclic triple systems, A spectral condition for odd cycles in non-bipartite graphs, Many cliques with few edges and bounded maximum degree, Unavoidable hypergraphs, Bipartite algebraic graphs without quadrilaterals, On some cycles in Wenger graphs, On even-cycle-free subgraphs of the doubled Johnson graphs, On the DLW conjectures, Extremal even-cycle-free subgraphs of the complete transposition graphs, Maximum cardinality neighbourly sets in quadrilateral free graphs, Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices, On the rational Turán exponents conjecture, A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints, Improved bounds for the extremal number of subdivisions, Properly colored \(C_4\)'s in edge-colored graphs, A variation of the Erdős-Sós conjecture in bipartite graphs, On the multi-colored Ramsey numbers of paths and even cycles, An extension of the rainbow Erdős-Rothschild problem, Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs, Relative Turán numbers for hypergraph cycles, Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs, Spectral extremal results for hypergraphs, Triangle-free subgraphs of hypergraphs, Extremal digraphs avoiding an orientation of \(C_4\), Degenerate Turán densities of sparse hypergraphs, Generalized Ramsey numbers: forbidding paths with few colors, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Unified approach to the generalized Turán problem and supersaturation, Counting copies of a fixed subgraph in \(F\)-free graphs, Generalized Turán problems for disjoint copies of graphs, Planar Turán numbers on short cycles of consecutive lengths, Stability results on the circumference of a graph, On 2-connected hypergraphs with no long cycles, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles, The feasibility problem for line graphs, Saturation numbers for disjoint stars, Turán numbers and batch codes, Inverse Turán numbers, On color isomorphic subdivisions, The generalized Turán number of spanning linear forests, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
