On a class of degenerate extremal graph problems
From MaRDI portal
Publication:1055428
DOI10.1007/BF02579343zbMATH Open0521.05037OpenAlexW2035971565MaRDI QIDQ1055428FDOQ1055428
Authors: Ralph Faudree, Miklós Simonovits
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579343
Cites Work
Cited In (52)
- On the spectral Turán problem of theta graphs
- Growth rates of the bipartite Erdős-Gyárfás function
- Graphs with few paths of prescribed length between any two vertices
- Maximum bipartite subgraphs in $H$-free graphs
- Color isomorphic even cycles and a related Ramsey problem
- On Turán exponents of bipartite graphs
- Random polynomial graphs for random Turán problems
- Turán numbers of bipartite subdivisions
- Diameters and Eigenvalues
- A new series of dense graphs of high girth
- Turán numbers of theta graphs
- On multiplicative bases of finite sets
- On the rational Turán exponents conjecture
- More on the extremal number of subdivisions
- Some sharp lower bounds for the bipartite Turán number of theta graphs
- Graphs without theta subgraphs
- Repeated patterns in proper colorings
- Shifted products that are coprime pure powers
- Supersaturation of even linear cycles in linear hypergraphs
- Maximum bisections of graphs without cycles of length 4
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- On the Turán number of theta graphs
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- On the homogeneous algebraic graphs of large girth and their applications
- Turán numbers and batch codes
- Spectral Turán problems for intersecting even cycles
- \(C_ 6\)-free bipartite graphs and product representation of squares
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Balanced supersaturation for some degenerate hypergraphs
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS
- On 0-1 matrices and small excluded submatrices
- On the extremal number of subdivisions
- Bipartite-ness under smooth conditions
- Extremal numbers of cycles revisited
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Polarities and \(2k\)-cycle-free graphs
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
- Explicit construction of graphs with an arbitrary large girth and of large size
- On optimization problems for graphs and security of digital communications
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Ramsey numbers of some bipartite graphs versus complete graphs
- Ramsey Size Linear Graphs
- Title not available (Why is that?)
- Compact topological minors in graphs
- General lemmas for Berge-Turán hypergraph problems
- Many Turán exponents via subdivisions
- General properties of some families of graphs defined by systems of equations
- On the Turán Number of Generalized Theta Graphs
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
- Cycles of given lengths in hypergraphs
This page was built for publication: On a class of degenerate extremal graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055428)