On the structure of linear graphs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Hereditary properties of hypergraphs
- Unit distances and diameters in Euclidean spaces
- On non-strong jumping numbers and density structures of hypergraphs
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- Separating pairs of points of standard boxes
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Extremal problems concerning transformations of the set of edges of the complete graph
- Hypergraphs do not jump
- On a Turán type problem of Erdős
- Davenport-Schinzel theory of matrices
- Packings of graphs and applications to computational complexity
- Induced subgraphs of given sizes
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory
- An extension of the Erdős-Stone theorem
- On the jumping constant conjecture for multigraphs
- Blow-up lemma
- Tournaments as strong subcontractions
- The extremal graph problem of the icosahedron
- Extremal graphs for intersecting cliques
- On the number of edges not covered by monochromatic copies of a fixed graph.
- On the complexity of finite subgraphs of the curve graph
- Graphs without theta subgraphs
- A note on non-jumping numbers for \(r\)-uniform hypergraphs
- Symmetry in Turán sums of squares polynomials from flag algebras
- On the Turán number of some ordered even cycles
- Stability results for graphs with a critical edge
- Some extremal results on complete degenerate hypergraphs
- On the local approach to Sidorenko's conjecture
- A skew version of the Loebl-Komlós-Sós conjecture
- The minimum number of triangles in graphs of given order and size
- Degree powers in graphs with a forbidden forest
- Edges not in any monochromatic copy of a fixed graph
- H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On the Turán density of \(\{1, 3\}\)-hypergraphs
- A linear algorithm for restructuring a graph
- Bipartite algebraic graphs without quadrilaterals
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Cycles of given lengths in hypergraphs
- On Ramsey - Turan type theorems for hypergraphs
- Covering non-uniform hypergraphs
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Almost-spanning subgraphs with bounded degree in dense graphs
- Turán's extremal problem in random graphs: Forbidding odd cycles
- Turán-Ramsey problems
- Structural properties of the line-graphs associated to directed networks
- On the Ramsey-Turán numbers of graphs and hypergraphs
- On the cover Turán number of Berge hypergraphs
- A short derivation for Turán numbers of paths
- On the rational Turán exponents conjecture
- Improved bounds for the extremal number of subdivisions
- In search of the densest subgraph
- The Turán number of star forests
- Counting sum-free sets in abelian groups
- A new upper bound on extremal number of even cycles
- Inverting the Turán problem with chromatic number
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
- Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- A note on stability for maximal \(F\)-free graphs
- The Turán number of the square of a path
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Rainbow saturation
- Non-jumping Turán densities of hypergraphs
- Generalized outerplanar Turán number of short paths
- A unified approach to hypergraph stability
- Tight bounds for powers of Hamilton cycles in tournaments
- A linear hypergraph extension of Turán's theorem
- Star-critical Ramsey numbers involving large books
- Inverse Turán numbers
- Supersaturation for subgraph counts
- On 1-subdivisions of transitive tournaments
- Ramsey numbers of fans and large books
- Turán numbers for hypergraph star forests
- Spectral extremal graphs for intersecting cliques
- Tilings in vertex ordered graphs
- Dirac-type theorems in random hypergraphs
- Some exact results for generalized Turán problems
- Size and structure of large \((s,t)\)-union intersecting families
- Accumulation points of the edit distance function
- The spectral radius of graphs with no intersecting odd cycles
- The Turán number of the triangular pyramid of 3-layers
- Generalized rainbow Turán problems
- Multicolor Turán numbers
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- Generalized Turán number for linear forests
- On the Ramsey-Turán density of triangles
- Some extremal results on hypergraph Turán problems
- Counting \(r\)-graphs without forbidden configurations
- Forbidding multiple copies of forestable graphs
- A version of the Loebl-Komlós-Sós conjecture for skew trees
- Extremal problems in uniformly dense hypergraphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Maximising the number of cycles in graphs with forbidden subgraphs
- Graphs with no induced \(K_{2,t}\)
- On induced saturation for paths
- Bounding the number of cycles in a graph in terms of its degree sequence
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- Large cliques in hypergraphs with forbidden substructures
- The Turán number for the edge blow-up of trees
- More on the extremal number of subdivisions
This page was built for publication: On the structure of linear graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5842850)
