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)
- 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?)
- F$F$‐factors in Quasi‐random Hypergraphs
- On embedding well-separable graphs
- Title not available (Why is that?)
- Tournaments as strong subcontractions
- Non-jumping Turán densities of hypergraphs
- Extremal problems in uniformly dense hypergraphs
- On multicolor Ramsey numbers and subset coloring of hypergraphs
- A neighborhood condition which implies the existence of a complete multipartite subgraph
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Some extremal problems for hereditary properties of graphs
- An extension of the Erdős-Stone theorem
- On the Ramsey-Turán density of triangles
- Turán-Ramsey theorems and simple asymptotically extremal structures
- An analogue of the Erdős-Stone theorem for finite geometries
- On the number of complete subgraphs and circuits contained in graphs
- A linear algorithm for restructuring a graph
- On the complexity of finite subgraphs of the curve graph
- Turán numbers of theta graphs
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Size and structure of large \((s,t)\)-union intersecting families
- On substructure densities of hypergraphs
- Tilings in vertex ordered graphs
- Extremal graphs for odd wheels
- Title not available (Why is that?)
- Hereditary properties of hypergraphs
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
- Induced subgraphs of given sizes
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
- Extremal \(G\)-free induced subgraphs of Kneser graphs
- Separating pairs of points of standard boxes
- Quadripartite version of the Hajnal-Szemerédi theorem
- Covering non-uniform hypergraphs
- Turánnical hypergraphs
- Evidence for a forbidden configuration conjecture: One more case solved
- Two approaches to Sidorenko's conjecture
- On the 3-local profiles of graphs
- 3-uniform hypergraphs avoiding a given odd cycle
- On the density of a graph and its blowup
- On the Turán density of \(\{1, 3\}\)-hypergraphs
- An exact Turán result for tripartite 3-graphs
- A note on the structure of Turán densities of hypergraphs
- Complete partite subgraphs in dense hypergraphs
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- A Density Turán Theorem
- Extremal \(H\)-free planar graphs
- On the jumping constant conjecture for multigraphs
- Variations on the theme of repeated distances
- A jump to the Bell number for hereditary graph properties
- On the structure of linear graphs
- On the extremal number of subdivisions
- Uniform Turán density of cycles
- Constructions of non-principal families in extremal hypergraph theory
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- On the Turán density of uniform hypergraphs
- Extremal results for odd cycles in sparse pseudorandom graphs
- On an extremal problem in graph theory.
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)
