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
- 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
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)
