Independent systems of representatives in weighted graphs
From MaRDI portal
Publication:2460628
DOI10.1007/s00493-007-2086-yzbMath1164.05020OpenAlexW2008097118MaRDI QIDQ2460628
Eli Berger, Ron Aharoni, Ran Ziv
Publication date: 12 November 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-2086-y
Related Items (46)
Unlabeled sample compression schemes and corner peelings for ample and maximum classes ⋮ Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ A revival of the girth conjecture ⋮ Independence-domination duality in weighted graphs ⋮ Aspects of topological approaches for data science ⋮ Independent transversals in locally sparse graphs ⋮ The circular chromatic index of graphs of high girth ⋮ A Note on Hitting Maximum and Maximal Cliques With a Stable Set ⋮ On factors of independent transversals in \(k\)-partite graphs ⋮ An average degree condition for independent transversals ⋮ Topological methods for the existence of a rainbow matching ⋮ Star clusters in independence complexes of graphs ⋮ On a conjecture of Stein ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ Fair representation in dimatroids ⋮ Graphs of low average degree without independent transversals ⋮ On a lower bound for the connectivity of the independence complex of a graph ⋮ The clique problem with multiple-choice constraints under a cycle-free dependency graph ⋮ Splittings of independence complexes and the powers of cycles ⋮ Chordal graphs, higher independence and vertex decomposable complexes ⋮ On maximum bipartite matching with separation ⋮ Packing list‐colorings ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ Fair Representation by Independent Sets ⋮ Unnamed Item ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ On rainbow matchings in bipartite graphs ⋮ Colorful paths for 3-chromatic graphs ⋮ Different versions of the nerve theorem and colourful simplices ⋮ Independence complexes of chordal graphs ⋮ A geometric Hall-type theorem ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ A note on interconnecting matchings in graphs ⋮ Cooperative colorings of trees and of bipartite graphs ⋮ A Stability Theorem for Matchings in Tripartite 3-Graphs ⋮ An asymptotic bound for the strong chromatic number ⋮ Finding independent transversals efficiently ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Coloring Graphs with Dense Neighborhoods ⋮ Coloring by two-way independent sets ⋮ The intersection of a matroid and a simplicial complex ⋮ Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph ⋮ A note on coloring vertex-transitive graphs ⋮ Cooperative colorings and independent systems of representatives
Cites Work
- Ryser's conjecture for tripartite 3-graphs
- The clique complex and hypergraph matching
- A solution to a colouring problem of P. Erdős
- Independent transversals in \(r\)-partite graphs
- Domination numbers and homology
- Triangulated spheres and colored cliques
- A tree version of Kőnig's theorem
- The list chromatic index of a bipartite multigraph
- A condition for matchability in hypergraphs
- A Note on Vertex List Colouring
- Hall's theorem for hypergraphs
- On the Strong Chromatic Number
- Transversals of Vertex Partitions in Graphs
- On Representatives of Subsets
This page was built for publication: Independent systems of representatives in weighted graphs
