On the structure of linear graphs
From MaRDI portal
Publication:5842850
DOI10.1090/S0002-9904-1946-08715-7zbMATH Open0063.01277OpenAlexW2111007781WikidataQ29395510 ScholiaQ29395510MaRDI QIDQ5842850FDOQ5842850
Authors: A. H. Stone, P. Erdős 
Publication date: 1946
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1946-08715-7
Recommendations
Cited In (only showing first 100 items - show all)
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- Maker-Breaker games on randomly perturbed graphs
- Graphs with few paths of prescribed length between any two vertices
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Almost-spanning subgraphs with bounded degree in dense graphs
- Random algebraic construction of extremal graphs
- The Turán number of star forests
- Some exact results for generalized Turán problems
- Turán numbers of bipartite subdivisions
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Improved bounds for the extremal number of subdivisions
- 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
- More on the extremal number of subdivisions
- A unified approach to hypergraph stability
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Inverse Turán numbers
- Inverting the Turán problem
- A note on non-jumping numbers for \(r\)-uniform hypergraphs
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
- Generalized Turán number for linear forests
- Minimum degree and the graph removal lemma
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearly \(k\)-distance sets
- Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- A new upper bound on extremal number of even cycles
- Bounding the number of cycles in a graph in terms of its degree sequence
- Non-jumping numbers for 5-uniform hypergraphs
- The Turán number of the square of a path
- Minimum degree conditions for large subgraphs
- Generalized rainbow Turán problems
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Minimal Ramsey graphs on deleting stars for generalized fans and books
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Some extremal results on complete degenerate hypergraphs
- Extremal Theta-free planar graphs
- The Turán number of the triangular pyramid of 3-layers
- Planar Turán numbers of short paths
- The minimum number of triangles in graphs of given order and size
- Star-critical Ramsey numbers involving large books
- Generalized outerplanar Turán number of short paths
- On the cover Turán number of Berge hypergraphs
- Many Turán exponents via subdivisions
- An irrational Lagrangian density of a single hypergraph
- Rainbow saturation
- Turán-Ramsey problems
- Degree powers in graphs with a forbidden forest
- A short derivation for Turán numbers of paths
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- Structural properties of the line-graphs associated to directed networks
- Perfect graphs of fixed density: counting and homogeneous sets
- Packing of graphs with small product of sizes
- A note on stability for maximal \(F\)-free graphs
- Supersaturation for subgraph counts
- The extremal graph problem of the icosahedron
- The extremal number of the subdivisions of the complete bipartite graph
- On Turán exponents of bipartite graphs
- On the local approach to Sidorenko's conjecture
- Dirac-type theorems in random hypergraphs
- A Spectral Erdős-Sós Theorem
- Edges Not Covered by Monochromatic Bipartite Graph
- On the codegree density of \(\mathrm{PG}_m(q)\)
- On the rational Turán exponents conjecture
- On non-strong jumping numbers and density structures of hypergraphs
- Tight bounds for powers of Hamilton cycles in tournaments
- On the structure of dense graphs with bounded clique number
- Graphs without theta subgraphs
- Edges not in any monochromatic copy of a fixed graph
- Induced Turán numbers
- Ramsey Numbers Involving Large Books
- In search of the densest subgraph
- Matroids denser than a clique
- Bipartite Turán problems for ordered graphs
- Embedding spanning subgraphs of small bandwidth
- Structural properties and tractability results for linear synteny
- Extremal problems for multigraphs
- On a conjecture of spectral extremal problems
- Large cliques in hypergraphs with forbidden substructures
- Title not available (Why is that?)
- The critical number of dense triangle-free binary matroids
- On low tree-depth decompositions
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- An Erdős-Stone Type Conjecture for Graphic Sequences
- The bipartite Turán number and spectral extremum for linear forests
- Forbidden subgraphs in the norm graph
- On a Turán type problem of Erdős
- Ramsey numbers of fans and large books
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- On the maximum number of odd cycles in graphs without smaller odd cycles
- A note on Turán's theorem
- Critical graphs without triangles: an optimum density construction
- A Local Approach to the Erdös--Sós Conjecture
- On 1-subdivisions of transitive tournaments
- Title not available (Why is that?)
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)
