On the structure of linear graphs

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

• On the structure of linear graphs
• On a theorem of Rademacher-Turán
• On the number of complete subgraphs and circuits contained in graphs
• scientific article; zbMATH DE number 3188526
• Turan's Graph Theorem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

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
• On a valence problem in extremal graph theory
• Ramsey numbers for cycles in graphs
• On finite simple groups and Kneser graphs.
• On the Chromatic Thresholds of Hypergraphs
• Maximum planar subgraphs in dense graphs
• The extremal function for partial bipartite tilings
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• Pan-\(H\)-linked graphs
• Asymptotic improvements to the lower bound of certain bipartite Turán numbers
• Excluding induced subgraphs. II: Extremal graphs
• Independent sets in hypergraphs
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Extremal results for random discrete structures
• On the existence of triangulated spheres in 3-graphs, and related problems
• Non-jumping numbers for 4-uniform hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• The maximum edit distance from hereditary graph properties
• Unit distances and diameters in Euclidean spaces
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs
• Minimal colorings for properly colored subgraphs
• Correlation among runners and some results on the lonely runner conjecture
• Hypergraphs do not jump
• Two results on Ramsey-Turán theory
• On families of subsets with a forbidden subposet
• On the Turán number of some ordered even cycles
• A linear hypergraph extension of Turán's theorem
• Some extremal results on hypergraph Turán problems
• On a conjecture of Erdős and Simonovits: even cycles
• On the Turán number of forests
• Turán numbers of bipartite graphs plus an odd cycle
• A version of the Loebl-Komlós-Sós conjecture for skew trees
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• A note on the jumping constant conjecture of Erdős
• The maximal length of a gap between \(r\)-graph Turán densities
• The number of \(C_{2\ell}\)-free graphs
• Title not available (Why is that?)
• Edge-decompositions of graphs with high minimum degree
• The Zero Forcing Number of Graphs
• Ramsey numbers of a fixed odd-cycle and generalized books and fans
• Packings of graphs and applications to computational complexity
• Hypergraphs do jump
• An Upper Bound on Zarankiewicz' Problem
• Extremal problems on set systems
• Blow-up lemma
• Turán number of bipartite graphs with no \(K_{t,t}\)
• The number of \(K_{m,m}\)-free graphs
• Extremal graphs for intersecting cliques
• The codegree threshold for 3-graphs with independent neighborhoods

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)