On the fractional intersection number of a graph

DOI10.1007/s003730050068zbMath0935.90043OpenAlexW1965948209MaRDI QIDQ1808721

Edward R. Scheinerman, Ann N. Trenk

Publication date: 25 November 1999

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050068

zbMATH Keywords

packingscoveringscliqueschordal graphsinterval graphsintersection numberlinear program relaxationfractional intersection numberrandom Bernoulli graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (11)

Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank ⋮ The intersection number of complete r-partite graphs ⋮ The Complexity of the Positive Semidefinite Zero Forcing ⋮ Graph models for scheduling systems with machine saturation property ⋮ Edge clique covers in graphs with independence number two ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ On the intersection number of a graph ⋮ On the triangle clique cover and \(K_t\) clique cover problems ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ Paired threshold graphs ⋮ On covering graphs by complete bipartite subgraphs

This page was built for publication: On the fractional intersection number of a graph