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)
- 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
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\)
- A conjecture of Verstraëte on vertex-disjoint cycles
- An Erdős-Gallai theorem for matroids
- A new class of Ramsey-Turán problems
- A generalization of Menger's theorem
- Corrigendum to ``Maxima of the \(Q\)-index: forbidden odd cycles
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
- Large circuits in binary matroids of large cogirth. I
- On the structure of linear graphs
- Nearly bipartite graphs
- Extensions of Turán's theorem on graphs
- Cycles in weighted graphs
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- Ramsey numbers for trees
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- On star-critical and upper size Ramsey numbers
- Coverings by few monochromatic pieces: a transition between two Ramsey problems
- The Ramsey numbers of paths versus wheels: a complete solution
- Maximum cuts in \(\mathscr{H} \)-free graphs
- Hypergraphs with no odd cycle of given length
- Compact topological minors in graphs
- Invitation to intersection problems for finite sets
- Asymptotic density of graphs excluding disconnected minors
- Generalized and geometric Ramsey numbers for cycles.
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Ramsey numbers of trees versus odd cycles
- Tight cycles and regular slices in dense hypergraphs
- On 3-uniform hypergraphs without a cycle of a given length
- On the maximum number of edges in a hypergraph with given matching number
- Maxima of the \(Q\)-index: forbidden odd cycles
- Extremal graphs for edge blow-up of graphs
- Many \(T\) copies in \(H\)-free graphs
- 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
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)
