On maximal paths and circuits of graphs
From MaRDI portal
Publication:3265306
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Proof of the Erdős matching conjecture in a new range
- A variation of a conjecture due to Erdös and Sós
- On the random version of the Erdős matching conjecture
- The Erdős matching conjecture and concentration inequalities
- Exact bipartite Turán numbers of large even cycles
- Minimum degree and size conditions for the proper connection number of graphs
- Extension of paths and cycles for hypergraphs
- Size and structure of large \((s,t)\)-union intersecting families
- The Turán number of the graph 3P5
- An improved bound for the monochromatic cycle partition number
- A Dirac-type theorem for uniform hypergraphs
- On mutually independent Hamiltonian paths
- Minimal colorings for properly colored subgraphs
- Paths and circuits in graphs: Extreme cases
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Spanning trees: A survey
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- Rainbow numbers for matchings in plane triangulations
- Generalized Ramsey numbers: forbidding paths with few colors
- Pentagons vs. triangles
- A Dirac theorem for trestles
- A note on the Turán number of an arbitrary star forest
- Singular Turán numbers and worm-colorings
- On 2-connected hypergraphs with no long cycles
- The Turán number of \(k \cdot S_\ell \)
- Some new results on the Turán number of star forests
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
- An analogue of the Erdős-Gallai theorem for random graphs
- On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\)
- A note on the stability results of the number of cliques in graphs with given matching number
- Extremal results for Berge hypergraphs
- A theorem on cycle-wheel Ramsey number
- Dense on-line arbitrarily partitionable graphs
- A generalization of Dirac's theorem
- Tilings in graphons
- Extremal graphs for odd wheels
- Asymptotic solution for a new class of forbidden r-graphs
- On the Turán number of forests
- The spectral even cycle problem
- Turán numbers for disjoint copies of graphs
- Two vertex-disjoint cycles in a graph
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
- Gaps in the saturation spectrum of trees
- On the saturation spectrum of families of cycle subdivisions
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai
- Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs
- Rainbow generalizations of Ramsey theory: A survey
- A condition for a graph to contain k-matching.
- The size of a hypergraph and its matching number
- Strong cliques and forbidden cycles
- Long paths with endpoints in given vertex-subsets of graphs
- Approximating long cycle above Dirac's guarantee
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- Covering a graph with cycles of length at least 4
- Graphs with almost all edges in long cycles
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
- scientific article; zbMATH DE number 2230241 (Why is no real title available?)
- Degree sum conditions on two disjoint cycles in graphs
- On the maximum size of connected hypergraphs without a path of given length
- Extremal G-free induced subgraphs of Kneser graphs
- On fan-wheel and tree-wheel Ramsey numbers
- Two new sufficient conditions for Hamilton-connected graphs
- Multicolour Ramsey numbers of paths and even cycles
- scientific article; zbMATH DE number 7525484 (Why is no real title available?)
- A two-person game on graphs where each player tries to encircle his opponent's men
- 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₄
- Binary matroids with no 4-spike minors
- Inverse Turán numbers
- Remarks on the Erdős matching conjecture for vector spaces
- Factorially many maximum matchings close to the Erdős-Gallai bound
- All Ramsey numbers for cycles in graphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Stability of extremal connected hypergraphs avoiding Berge-paths
- The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
- Maximum cuts of graphs with forbidden cycles
- Turán numbers of multiple paths and equibipartite forests
- Spaces of \(p\)-vectors of bounded rank
- Balanced generic circuits without long paths
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Eigenvalues and forbidden subgraphs. I.
- scientific article; zbMATH DE number 2230293 (Why is no real title available?)
- On the \(A_\alpha\)-spectral radius of graphs without linear forests
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
- The Ramsey number of a long even cycle versus a star
- Turán numbers of Berge trees
- Generalized Turán number of even linear forests
- The Turán number for \(4 \cdot S_{\ell}^1\)
- Further results on the generalized Turán number of spanning linear forests
- The Erdős-Sós conjecture for spiders
- Generalized Turán number for linear forests
- The formula for Turán number of spanning linear forests
- Lagrangian densities of enlargements of matchings in hypergraphs
- Two results about the Turán number of star forests
- The shifting method and generalized Turán number of matchings
- Spectral extrema of graphs with bounded clique number and matching number
- Vertex coverings by monochromatic cycles and trees
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)
