On the structure of linear graphs
From MaRDI portal
Publication:5842850
Recommendations
Cited in
(only showing first 100 items - show all)- The maximum number of triangles in \(F_k\)-free graphs
- Packing of graphs with small product of sizes
- Many \(T\) copies in \(H\)-free graphs
- Nearly-regular hypergraphs and saturation of Berge stars
- Perfect graphs of fixed density: counting and homogeneous sets
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- On finite simple groups and Kneser graphs.
- A 2-stable family of triple systems
- On multicolor Ramsey numbers and subset coloring of hypergraphs
- scientific article; zbMATH DE number 3084814 (Why is no real title available?)
- Maker-Breaker games on randomly perturbed graphs
- On a valence problem in extremal graph theory
- Ramsey numbers for cycles in graphs
- Graphs with few paths of prescribed length between any two vertices
- On Generalized Turán Results in Height Two Posets
- The exact minimum number of triangles in graphs with given order and size
- A note on stability for maximal \(F\)-free graphs
- Maximum planar subgraphs in dense graphs
- On vertex-induced weighted Turán problems
- A neighborhood condition which implies the existence of a complete multipartite subgraph
- H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- Supersaturation for subgraph counts
- The extremal function for partial bipartite tilings
- The extremal graph problem of the icosahedron
- On the number of edges not covered by monochromatic copies of a fixed graph.
- On the Chromatic Thresholds of Hypergraphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Turán numbers for hypergraph star forests
- Almost-spanning subgraphs with bounded degree in dense graphs
- A hierarchy of randomness for graphs
- An Extremal Graph Problem with a Transcendental Solution
- Pan-\(H\)-linked graphs
- Phase transitions of structured codes of graphs
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- The extremal number of the subdivisions of the complete bipartite graph
- On the local approach to Sidorenko's conjecture
- The Turán number of star forests
- Some exact results for generalized Turán problems
- Random algebraic construction of extremal graphs
- Some extremal problems for hereditary properties of graphs
- Excluding induced subgraphs. II: Extremal graphs
- On Turán exponents of bipartite graphs
- An analogue of the Erdős-Stone theorem for finite geometries
- An extension of the Erdős-Stone theorem
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Maximising the number of cycles in graphs with forbidden subgraphs
- Graphs with no induced \(K_{2,t}\)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- Spectral extremal graphs for intersecting cliques
- On the Ramsey-Turán density of triangles
- Turán-Ramsey theorems and simple asymptotically extremal structures
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Extremal density for sparse minors and subdivisions
- The spectral radius of graphs with no intersecting odd cycles
- Dirac-type theorems in random hypergraphs
- Graph cover-saturation
- Turán numbers of bipartite subdivisions
- Improved bounds for the extremal number of subdivisions
- Random polynomial graphs for random Turán problems
- Rainbow clique subdivisions
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Extremal results for random discrete structures
- A linear algorithm for restructuring a graph
- On the complexity of finite subgraphs of the curve graph
- Non-jumping numbers for 4-uniform hypergraphs
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- On the number of complete subgraphs and circuits contained in graphs
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Independent sets in hypergraphs
- The maximum edit distance from hereditary graph properties
- On the existence of triangulated spheres in 3-graphs, and related problems
- A Spectral Erdős-Sós Theorem
- Unit distances and diameters in Euclidean spaces
- Spectral Turán-type problems on cancellative hypergraphs
- Turán numbers of theta graphs
- Generating non-jumping numbers recursively
- Tree decompositions of graphs without large bipartite holes
- On jumping densities of hypergraphs
- Edges Not Covered by Monochromatic Bipartite Graph
- Forbidding multiple copies of forestable graphs
- Size and structure of large \((s,t)\)-union intersecting families
- Correlation among runners and some results on the lonely runner conjecture
- On substructure densities of hypergraphs
- Minimal colorings for properly colored subgraphs
- Hypergraphs do not jump
- Structured Codes of Graphs
- Minimizing the number of 5-cycles in graphs with given edge-density
- Bipartite algebraic graphs without quadrilaterals
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Tilings in vertex ordered graphs
- On non-strong jumping numbers and density structures of hypergraphs
- Multicolor Turán numbers
- The Turán number for the edge blow-up of trees
- Two results on Ramsey-Turán theory
- On the codegree density of \(\mathrm{PG}_m(q)\)
- On the rational Turán exponents conjecture
- Two-colored Ramsey-Turán densities involving triangles
- Hereditary properties of hypergraphs
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
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)