On the maximal number of independent circuits in a graph
From MaRDI portal
Publication:5728985
DOI10.1007/BF01895727zbMath0118.19001OpenAlexW4361866456WikidataQ60060514 ScholiaQ60060514MaRDI QIDQ5728985
No author found.
Publication date: 1963
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01895727
Related Items (only showing first 100 items - show all)
An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ Minimum Degree and Disjoint Cycles in Claw-Free Graphs ⋮ A refinement of theorems on vertex-disjoint chorded cycles ⋮ Triangles in randomly perturbed graphs ⋮ K4−‐factor in a graph ⋮ Nested cycles with no geometric crossings ⋮ Extremal density for sparse minors and subdivisions ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Unnamed Item ⋮ Triangle-Tilings in Graphs Without Large Independent Sets ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Cycles of Given Size in a Dense Graph ⋮ Bandwidth, treewidth, separators, expansion, and universality ⋮ Disjoint cycles in graphs with distance degree sum conditions ⋮ On degree sum conditions and vertex-disjoint chorded cycles ⋮ Disjoint directed cycles with specified lengths in directed bipartite graphs ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ On vertex-disjoint cycles and degree sum conditions ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ Two disjoint cycles in digraphs ⋮ Embedding spanning subgraphs of small bandwidth ⋮ The Ramsey numbers of squares of paths and cycles ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Forcing a sparse minor ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Tree decompositions of graphs without large bipartite holes ⋮ Minimum degree conditions for vertex-disjoint even cycles in large graphs ⋮ Disjoint long cycles in a graph ⋮ Triangle strings: structures for augmentation of vertex-disjoint triangle sets ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Unnamed Item ⋮ The number of circuits of length 4 inPSL(2,ℤ)-space ⋮ A Conjecture of Verstraëte on Vertex-Disjoint Cycles ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Perfect packings with complete graphs minus an edge ⋮ Edge-dominating cycles in graphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Tiling edge-ordered graphs with monotone paths and other structures ⋮ Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph ⋮ Optimal spread for spanning subgraphs of Dirac hypergraphs ⋮ Spanning trees in graphs without large bipartite holes ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Towards a Weighted Version of the Hajnal–Szemerédi Theorem ⋮ Independent triangles covering given vertices of a graph ⋮ A degree condition of 2-factors in bipartite graphs ⋮ On the Bollobás–Eldridge Conjecture for Bipartite Graphs ⋮ On 2-factors with prescribed properties in a bipartite graph ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ Unnamed Item ⋮ Proof of a tiling conjecture of Komlós ⋮ Partial degrees on matchings for cycles in bipartite graphs ⋮ On vertex-disjoint chorded cycles and degree sum conditions ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ \(H\)-factors in graphs with small independence number ⋮ Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs ⋮ On the number of independent chorded cycles in a graph ⋮ \(k\) disjoint cycles containing specified independent vertices ⋮ A robust Corrádi-Hajnal theorem ⋮ Graph curvature and local discrepancy ⋮ Triangle‐factors in pseudorandom graphs ⋮ The point-arboricity of a graph ⋮ Embedding spanning subgraphs in uniformly dense and inseparable graphs ⋮ On Komlós’ tiling theorem in random graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Partial Degree Conditions and Cycle Coverings ⋮ Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs ⋮ Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs ⋮ Unnamed Item ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Embedding Graphs Having Ore-Degree at Most Five ⋮ Minimum degree conditions for large subgraphs ⋮ Disjoint Even Cycles Packing ⋮ Large planar subgraphs in dense graphs ⋮ Disjoint Chorded Cycles of the Same Length ⋮ On independent doubly chorded cycles ⋮ Nested cycles with no geometric crossings ⋮ Sharp minimum degree conditions for the existence of disjoint theta graphs ⋮ Decompositions of complete graphs into circulants ⋮ Independent cycles with limited size in a graph ⋮ The minimum degree threshold for perfect graph packings ⋮ Vertex-disjoint cycles containing specified vertices in a bipartite graph
Cites Work
This page was built for publication: On the maximal number of independent circuits in a graph
