Domination numbers and homology

From MaRDI portal
Publication:1395819

DOI10.1016/S0097-3165(03)00045-1zbMath1030.05086MaRDI QIDQ1395819

Roy Meshulam

Publication date: 1 July 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)




Related Items (56)

Distance \(r\)-domination number and \(r\)-independence complexes of graphsVector representation of graph dominationA revival of the girth conjectureTopology of clique complexes of line graphsOn the homology of independence complexesMatroid representation of clique complexesVertex decomposable graphs and obstructions to shellabilityIndependent transversals in locally sparse graphsThe circular chromatic index of graphs of high girthHigher Independence Complexes of graphs and their homotopy typesAn average degree condition for independent transversalsTopological methods for the existence of a rainbow matchingA characterization of simplicial polytopes with \(g_{2}=1\)On a conjecture of SteinGraphs of low average degree without independent transversalsOn a lower bound for the connectivity of the independence complex of a graphChoice functionsSplittings of independence complexes and the powers of cyclesInduced equators in flag spheresBounds for Entries of $\gamma$-Vectors of Flag Homology SpheresOn the Gamma-Vector of Symmetric Edge PolytopesChordal graphs, higher independence and vertex decomposable complexesNonvanishing Betti numbers of edge ideals of weakly chordal graphsOn the flag \(f\)-vector of a graded lattice with nontrivial homologyDominance complexes and vertex cover numbers of graphsSome combinatorial properties of flag simplicial pseudomanifolds and spheresOn \(\gamma \)-vectors satisfying the Kruskal-Katona inequalitiesDegree Conditions for Matchability in 3‐Partite HypergraphsThe intersection of a matroid and an oriented matroidColorful theorems for strong convexityStable sets in flag spheresUnnamed ItemDomination numbers and noncover complexes of hypergraphsIndependent systems of representatives in weighted graphsTwo disjoint independent bases in matroid-graph pairsOn rainbow matchings in bipartite graphsBalanced complexes and complexes without large missing facesA variation on the homological nerve theoremRainbow simplices in triangulations of manifoldsA topological colorful Helly theoremDifferent versions of the nerve theorem and colourful simplicesIndependence complexes of chordal graphsA geometric Hall-type theoremAcyclic systems of representatives and acyclic colorings of digraphsA note on interconnecting matchings in graphsFlag complexes and homologyStable sets in flag spheresCollapsibility of non-cover complexes of graphsA Stability Theorem for Matchings in Tripartite 3-GraphsComplexes of directed trees and independence complexesEigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence ComplexesThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and TverbergRemoving degeneracy in LP-type problems revisitedWI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalencesThe intersection of a matroid and a simplicial complexCooperative colorings and independent systems of representatives



Cites Work


This page was built for publication: Domination numbers and homology