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)
- 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
- Disjoint directed cycles in directed graphs
- Stability in the Erdős-Gallai theorem on cycles and paths. II
- Paths and circuits in g-graphs
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On the multi-colored Ramsey numbers of paths and even cycles
- Making an H $H$‐free graph k $k$‐colorable
- Spectral extremal results with forbidding linear forests
- Cycles of given lengths in hypergraphs
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Covering vertices of a graph by \(k\) disjoint cycles
- Connected graphs without long paths
- Extremal numbers for odd cycles
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
- Anti-Ramsey number of matchings in hypergraphs
- Hamiltonicity of 2-connected quasi-claw-free graphs
- Rainbow matchings in properly-colored hypergraphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- Rainbow Turán problems for paths and forests of stars
- Some remarks on long monochromatic cycles in edge-colored complete graphs
- Flots et tensions dans un graphe
- Long cycles and the codiameter of a graph. I
- Hypergraphs with no cycle of a given length
- Cycles in 2-connected graphs
- Hypergraphs with no cycle of length 4
- Graph invariants and large cycles: a survey
- A sufficient degree condition for a graph to contain all trees of size \(k\)
- Complete solution for the rainbow numbers of matchings
- Exact bipartite Turán numbers of large even cycles
- A variation of a conjecture due to Erdös and Sós
- Minimum degree and size conditions for the proper connection number of graphs
- Size and structure of large \((s,t)\)-union intersecting families
- On mutually independent Hamiltonian paths
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- Extremal results for Berge hypergraphs
- An analogue of the Erdős-Gallai theorem for random graphs
- Pentagons vs. triangles
- A Dirac theorem for trestles
- Tilings in graphons
- A generalization of Dirac's theorem
- On the Turán number of forests
- Turán numbers for disjoint copies of graphs
- Degree sum conditions on two disjoint cycles in graphs
- The size of 3-uniform hypergraphs with given matching number and codegree
- The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
- Turán numbers of multiple paths and equibipartite forests
- Title not available (Why is that?)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Balanced generic circuits without long paths
- 3-uniform hypergraphs avoiding a given odd cycle
- Breaking the rhythm on graphs
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
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)
