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)
- \(\mathcal{F}\)-saturation games
- Ramsey numbers for cycles in graphs
- On Hamiltonian bipartite graphs
- The extremal function for partial bipartite tilings
- On the optimality of Bellman-Ford-Moore shortest path algorithm
- On some three-color Ramsey numbers for paths
- A spectral condition for odd cycles in graphs
- Improved bound on vertex degree version of Erdős matching conjecture
- Minimal paths and cycles in set systems
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- On the multi-colored Ramsey numbers of cycles
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Weakly pancyclic graphs
- Linear trees in uniform hypergraphs
- On the existence of triangulated spheres in 3-graphs, and related problems
- The spectral radius of graphs without paths and cycles of specified length
- Proof of the Erdős matching conjecture in a new range
- On the random version of the Erdős matching conjecture
- The Erdős matching conjecture and concentration inequalities
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Minimal colorings for properly colored subgraphs
- Extension of paths and cycles for hypergraphs
- An improved bound for the monochromatic cycle partition number
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Spanning trees: A survey
- Rainbow numbers for matchings in plane triangulations
- A theorem on cycle-wheel Ramsey number
- Asymptotic solution for a new class of forbidden r-graphs
- The size of a hypergraph and its matching number
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
- Rainbow generalizations of Ramsey theory: A survey
- Long paths with endpoints in given vertex-subsets of graphs
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- On fan-wheel and tree-wheel Ramsey numbers
- Spaces of \(p\)-vectors of bounded rank
- All Ramsey numbers for cycles in graphs
- The Erdős-Sós conjecture for spiders
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
- Path Ramsey numbers in multicolorings
- Vertex coverings by monochromatic cycles and trees
- On restricted colourings of \(K_ n\)
- Degree powers in \(C_5\)-free graphs
- Spaces of symmetric matrices of bounded rank
- Partitioning complete bipartite graphs by monochromatic cycles
- All Ramsey numbers for brooms in graphs
- Hypergraph extensions of the Erdős-Gallai theorem
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Edge-colorings of complete graphs that avoid polychromatic trees
- Turán problems and shadows. I: Paths and cycles
- Title not available (Why is that?)
- Long cycles, heavy cycles and cycle decompositions in digraphs
- The multicolour Ramsey number of a long odd cycle
- Tight cycles in hypergraphs
- Graph saturation games
- On the Turán number for the hexagon
- Monochromatic cycle partitions in local edge colorings
- Rainbow numbers for matchings and complete graphs
- On the vertex \(k\)-path cover
- Hypergraph extensions of the Erdős-Gallai theorem
- Packing of graphs - a survey
- Small topological complete subgraphs of ``dense graphs
- The Ramsey numbers of wheels versus odd cycles
- Cycles and stability
- Cycle packing
- Monochromatic cycles in 2-coloured graphs
- Inverting the Turán problem with chromatic number
- On completely positive graphs and their complements
- On some extremal problems in graph theory
- On maximal circuits in directed graphs
- On the maximal number of independent circuits in a graph
- Universal graphs with forbidden subgraphs and algebraic closure
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Stability in the Erdős-Gallai theorems on cycles and paths
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Families of finite sets in which no set is covered by the union of \(r\) others
- Maximal circuits of graphs. I
- Hypergraph Turán numbers of linear cycles
- Large cycles in graphs
- Disjoint complete minors and bipartite minors
- Ramsey-goodness -- and otherwise
- Spectral radius and Hamiltonian properties of graphs
- On the minimal length of the longest trail in a fixed edge-density graph
- 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
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)
