On maximal paths and circuits of graphs
From MaRDI portal
Publication:3265306
DOI10.1007/BF02024498zbMATH Open0090.39401OpenAlexW1996106086WikidataQ105583464 ScholiaQ105583464MaRDI QIDQ3265306FDOQ3265306
Authors: Tibor Gallai, P. Erdős 
Publication date: 1959
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02024498
Recommendations
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
Cited In (only showing first 100 items - show all)
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- An Erdős-Gallai type theorem for vertex colored graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Maximum graphs non-Hamiltonian-connected from a vertex
- The Turán number of star forests
- Counting H-free orientations of graphs
- On the anti-Ramsey number of forests
- Connected hypergraphs without long Berge-paths
- A variation of the Erdős-Sós conjecture in bipartite graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- On 2-connected hypergraphs with no long cycles
- Covering a graph with cycles of length at least 4
- Graphs with almost all edges in long cycles
- Two new sufficient conditions for Hamilton-connected graphs
- Inverse Turán numbers
- Remarks on the Erdős matching conjecture for vector spaces
- Maximum cuts of graphs with forbidden cycles
- The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
- Generalized Turán number of even linear forests
- Further results on the generalized Turán number of spanning linear forests
- Generalized Turán number for linear forests
- The formula for Turán number of spanning linear forests
- The shifting method and generalized Turán number of matchings
- Title not available (Why is that?)
- Extremal graphs for the distinguishing index
- Old and new applications of Katona's circle
- Note on long paths in Eulerian digraphs
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The codiameter of a 2-connected graph
- Saturation spectrum of paths and stars
- The Ramsey numbers for a triple of long cycles
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- The Turán number of the square of a path
- Generalized Turán problems for even cycles
- Generalized rainbow Turán problems
- Maximizing the number of cliques in graphs with given matching number
- Star-critical Ramsey numbers of cycles versus wheels
- On the size of shadow-added intersecting families
- A note on the Turán number of a Berge odd cycle
- New Ore's type results on hamiltonicity and existence of paths of given length in graphs
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Planar Turán numbers on short cycles of consecutive lengths
- Maximum bipartite subgraphs in graphs without short cycles
- Threshold Ramsey multiplicity for paths and even cycles
- Degree sums and spanning brooms of a graph
- Turán numbers of complete 3-uniform Berge-hypergraphs
- On the size of the product of overlapping families
- Star-critical Ramsey numbers of wheels versus odd cycles
- Maximum size of a graph with given fractional matching number
- Tibor Gallai
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- A short derivation for Turán numbers of paths
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
- The structure of hypergraphs without long Berge cycles
- The k‐path vertex cover: General bounds and chordal graphs
- Longest paths joining given vertices in a graph
- Avoiding long Berge cycles
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- On the rainbow Turán number of paths
- Alternating Hamiltonian cycles
- Families with no matchings of size \(s\)
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
- The Turán number of the graph 3P5
- Paths and circuits in graphs: Extreme cases
- Extremal graphs for odd wheels
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
- Title not available (Why is that?)
- Multicolour Ramsey numbers of paths and even cycles
- On the maximum size of connected hypergraphs without a path of given length
- Extremal \(G\)-free induced subgraphs of Kneser graphs
- Eigenvalues and forbidden subgraphs. I.
- Monophonic convexity in weighted graphs
- An Erdős-Gallai type theorem for uniform hypergraphs
- On the Turán number of theta graphs
- The Turán number of the graph \(2P_5\)
- Families of finite sets satisfying intersection restrictions
- The maximum number of cliques in graphs without long cycles
- On independent cycles and edges in graphs
- The Turán number of the graph \(3P_4\)
- Generalized Ramsey theory for multiple colors
- Three results on cycle-wheel Ramsey numbers
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
- The bipartite Turán number and spectral extremum for linear forests
- Rainbow cycles in edge-colored graphs
- On the Erdős–Sós conjecture for trees with bounded degree
- Disjoint long cycles in a graph
- The generalized Turán number of spanning linear forests
- Graphs with large maximum degree containing no odd cycles of a given length
- On an extremal problem in graph theory.
- Minimum degree of 3-graphs without long linear paths
- Dense arbitrarily partitionable graphs
- Berge cycles in non-uniform hypergraphs
- Homomorphism thresholds for odd cycles
- An Ore-type condition for the existence of two disjoint cycles
- Stability results on the circumference of a graph
- Stability version of Dirac's theorem and its applications for generalized Turán problems
- On the anti-Ramsey numbers of linear forests
- General lemmas for Berge-Turán hypergraph problems
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
This page was built for publication: On maximal paths and circuits of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3265306)
