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
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, 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, 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, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, On the number of independent chorded cycles in a graph, \(k\) disjoint cycles containing specified independent vertices, 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, On the Corrádi-Hajnal theorem and a question of Dirac, On independent cycles and edges in graphs, The confirmation of a conjecture on disjoint cycles in a graph, Disjoint cycles in graphs with restricted independence number, Graph factors and factorization: 1985--2003: a survey, Disjoint cycles in digraphs, Blow-up lemma, On a conjecture on directed cycles in a directed bipartite graph, 2-factors in dense graphs, Neighborhood unions for the existence of disjoint chorded cycles in graphs, Disjoint cycles and chorded cycles in a graph with given minimum degree, On a sharp degree sum condition for disjoint chorded cycles in graphs, Independence number and vertex-disjoint cycles, Partition of a directed bipartite graph into two directed cycles, The edge condition for independent cycles with chords in bipartite graphs, Proof of the Erdős-Faudree conjecture on quadrilaterals, Graphs containing every 2-factor, Decompositions of graphs into cycles with chords, Vertex-disjoint chorded cycles in a graph, Disjoint directed cycles in directed graphs, Lichiardopol's conjecture on disjoint cycles in tournaments, Sharpening an ore-type version of the Corrádi-Hajnal theorem, On directed versions of the Corrádi-Hajnal corollary, Approximate multipartite version of the Hajnal-Szemerédi theorem, A note on disjoint cycles, On the existence of vertex-disjoint subgraphs with high degree sum, Vertex-disjoint cycles of the same length., Covering vertices of a graph by \(k\) disjoint cycles, Fan-type condition on disjoint cycles in a graph, Completion and deficiency problems, The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Disjoint cliques in claw-free graphs, How tight is the corner relaxation? Insights gained from the stable set problem, Combinatorial and computational aspects of graph packing and graph decomposition, On the purity of minor-closed classes of graphs, On a tiling conjecture of Komlós for 3-chromatic graphs., Equitable and proportional coloring of trees, Covering the vertices of a digraph by cycles of prescribed length, On the KŁR conjecture in random graphs, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, On vertex-disjoint triangles in tripartite graphs and multigraphs, Cycle multiplicity of some total graphs, Quadripartite version of the Hajnal-Szemerédi theorem, Subdivisions of graphs: A generalization of paths and cycles, Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph, Transitive triangle tilings in oriented graphs, Almost \(H\)-factors in dense graphs, A refinement of a result of Corrádi and Hajnal, Covering a graph with cycles of length at least 4, Proof of the bandwidth conjecture of Bollobás and Komlós, Tiling tripartite graphs with 3-colorable graphs: the extreme case, \(K_r\)-factors in graphs with low independence number, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Vertex-disjoint rainbow triangles in edge-colored graphs, An improvement of Lichiardopol's theorem on disjoint cycles in tournaments, Packing disjoint cycles over vertex cuts, Vertex-disjoint quadrilaterals in graphs, Chromatic number via Turán number, Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs, Graph partition into \(K_{3}\)s and \(K_{4}\)s, Ore-type conditions for bipartite graphs containing hexagons, Star-factors in graphs with large minimum degree, \(K_{1,3}\)-factors in graphs, Disjoint chorded cycles in graphs, Packings of graphs and applications to computational complexity, Graph partition into small cliques, On the minors of an incidence matrix and Smith normal form, On 2-factors with cycles containing specified edges in a bipartite graph, Degree condition for subdivisions of unicyclic graphs, Edge disjoint placement of graphs, Subgraphs with triangular components, Covering the vertices of a graph with cycles of bounded length, Triangle packings and 1-factors in oriented graphs, Vertex-disjoint double chorded cycles in bipartite graphs, Neighborhood unions and disjoint chorded cycles in graphs, On 2-factors with cycles containing specified vertices in a bipartite graph, A two-person game on graphs where each player tries to encircle his opponent's men, Disjoint cycles and \(2\)-factors with Fan-type condition in a graph, Distance spectrum, 1-factor and vertex-disjoint cycles, Vertex-disjoint claws in graphs, Cycle factors in dense graphs, On Enomoto's problems in a bipartite graph, Ore-type conditions implying 2-factors consisting of short cycles, Vertex-disjoint hexagons with chords in a bipartite graph, Triangles in claw-free graphs, Cyclic triangle factors in regular tournaments, On quadrilaterals in a graph, On the maximum number of independent cycles in a graph, Girth in graphs, Disjoint cycles with partial degree conditions in claw-free graphs, Results and problems on chorded cycles: a survey, 2-proper partition of a graph, \(F\)-factors in hypergraphs via absorption, A degree sequence Hajnal-Szemerédi theorem
Cites Work
