Pages that link to "Item:Q5416078"
From MaRDI portal
The following pages link to The History of Degenerate (Bipartite) Extremal Graph Problems (Q5416078):
Displaying 50 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- The number of \(C_{2\ell}\)-free graphs (Q291780) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- Proof of a conjecture on monomial graphs (Q346278) (← links)
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- On the multi-colored Ramsey numbers of paths and even cycles (Q727052) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko (Q1621060) (← links)
- Degenerate Turán problems for hereditary properties (Q1630890) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets (Q1690033) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Edges not in any monochromatic copy of a fixed graph (Q1719571) (← links)
- Bipartite algebraic graphs without quadrilaterals (Q1744742) (← links)
- On the DLW conjectures (Q1747228) (← links)
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices (Q1752672) (← links)
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- On some cycles in Wenger graphs (Q1987600) (← links)
- On the rational Turán exponents conjecture (Q1998761) (← links)
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints (Q1999736) (← links)
- Improved bounds for the extremal number of subdivisions (Q2001982) (← links)
- Properly colored \(C_4\)'s in edge-colored graphs (Q2005704) (← links)
- A variation of the Erdős-Sós conjecture in bipartite graphs (Q2014230) (← links)
- An extension of the rainbow Erdős-Rothschild problem (Q2032865) (← links)
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs (Q2033928) (← links)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs (Q2049617) (← links)
- Spectral extremal results for hypergraphs (Q2049621) (← links)
- Triangle-free subgraphs of hypergraphs (Q2053717) (← links)
- Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
- Planar Turán numbers on short cycles of consecutive lengths (Q2079819) (← links)
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
- The feasibility problem for line graphs (Q2097181) (← links)
- Saturation numbers for disjoint stars (Q2099391) (← links)
- Inverse Turán numbers (Q2113336) (← links)
- On color isomorphic subdivisions (Q2113360) (← links)
- The generalized Turán number of spanning linear forests (Q2115153) (← links)
- Spectral extremal graphs for intersecting cliques (Q2125679) (← links)
- Remarks on an edge-coloring problem (Q2132387) (← links)
- The spectral radius of graphs with no intersecting odd cycles (Q2142645) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Singular Turán numbers and worm-colorings (Q2158187) (← links)