On maximal paths and circuits of graphs
From MaRDI portal
Publication:3265306
DOI10.1007/BF02024498zbMath0090.39401OpenAlexW1996106086WikidataQ105583464 ScholiaQ105583464MaRDI QIDQ3265306
No author found.
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (only showing first 100 items - show all)
Ramsey numbers of large even cycles and fans ⋮ Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs ⋮ On the saturation spectrum of families of cycle subdivisions ⋮ On the \(A_\alpha\)-spectral radius of graphs without linear forests ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ The Ramsey number of a long even cycle versus a star ⋮ Localized versions of extremal problems ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Book free 3-uniform hypergraphs ⋮ Families with restricted matching number and multiply covered shadows ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Turán graphs with bounded matching number ⋮ Spectral Turán problems for intersecting even cycles ⋮ Graphs without a Rainbow Path of Length 3 ⋮ On Turán problems with bounded matching number ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ Extremal numbers for disjoint copies of a clique ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ A Dirac-type theorem for uniform hypergraphs ⋮ The signless Laplacian spectral radius of graphs without intersecting odd cycles ⋮ The spectral even cycle problem ⋮ Counting rainbow triangles in edge-colored graphs ⋮ The maximum number of cliques in graphs with bounded odd circumference ⋮ Trimming forests is hard (unless they are made of stars) ⋮ How connectivity affects the extremal number of trees ⋮ Antidirected subgraphs of oriented graphs ⋮ Extremal graphs for the odd prism ⋮ Exact generalized Turán numbers for even linear forests ⋮ A stability result of the Pósa lemma ⋮ Extremal graphs without long paths and large cliques ⋮ Exact results on generalized Erdős-Gallai problems ⋮ A Brualdi-Hoffman-Turán problem on cycles ⋮ Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs ⋮ The Turán number of \(P_9 \cup P_7\) ⋮ Spectral radius and rainbow Hamilton paths of a graph ⋮ A note on the stability results of the number of cliques in graphs with given matching number ⋮ Approximating long cycle above Dirac's guarantee ⋮ Coloring of graphs avoiding bicolored paths of a fixed length ⋮ On the generalized Turán problem for odd cycles ⋮ On the Turán number of edge blow-ups of cliques ⋮ The structure of hypergraphs without long Berge cycles ⋮ Maxima of the \(Q\)-index for \(3 K_3\)-free graphs ⋮ A localized approach to generalized Turán problems ⋮ Some results around the Erdős matching conjecture ⋮ The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs ⋮ On the Turán numbers of linear forests in bipartite graphs ⋮ Longest cycle above Erdős-Gallai bound ⋮ Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs ⋮ Localized version of hypergraph Erdős-Gallai theorem ⋮ Spectral extremal problem on \(t\) copies of \(\ell\)-cycles ⋮ Dense circuit graphs and the planar Turán number of a cycle ⋮ Generalized regular Turán numbers ⋮ Turán number of two vertex-disjoint copies of cliques. ⋮ A localized approach for Turán number of long cycles ⋮ Spectral conditions for traceability of connected claw-free graphs ⋮ Hypergraph Extensions of the Erdős-Gallai Theorem ⋮ Monochromatic Cycles in 2-Coloured Graphs ⋮ On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size ⋮ The Maximum Number of Triangles in C2k+1-Free Graphs ⋮ Hypergraphs with No Cycle of a Given Length ⋮ Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size ⋮ Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ On the Erdős–Sós conjecture for trees with bounded degree ⋮ Powers of paths in tournaments ⋮ Rainbow version of the Erdős Matching Conjecture via concentration ⋮ The Size of a Hypergraph and its Matching Number ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Flots et tensions dans un graphe ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ RAMSEY NUMBERS FOR TREES ⋮ A note on fractional covers of a graph ⋮ Counting H-free orientations of graphs ⋮ Monochromatic Cycle Partitions in Local Edge Colorings ⋮ Ramsey Size Linear Graphs ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ The Turán number of the graph 3P5 ⋮ On Generalized Turán Results in Height Two Posets ⋮ Degree conditions and relative length of longest paths and cycles in graphs ⋮ Spectral extrema of graphs with bounded clique number and matching number ⋮ Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ Outerplanar Turán numbers of cycles and paths ⋮ Turán numbers for disjoint paths ⋮ Extremal graphs for odd wheels ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Large simple \(d\)-cycles in simplicial complexes ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ On families with bounded matching number ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
Cites Work
This page was built for publication: On maximal paths and circuits of graphs
