Results 11 to 20 of about 24,507 (264)
Exactly Hittable Interval Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in ...
S. M. Dhannya +2 more
doaj +1 more source
On the generation of circuits and minimal forbidden sets [PDF]
Mathematical Programming, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stork, F., Uetz, M.J.
openaire +3 more sources
Pinch Analysis Approach for Segregated Targeting Networks with Forbidden Matches
Chemical Engineering Transactions, 2022 Conservation of different resources is an important prerequisite toward overall sustainable development. Pinch Analysis has evolved over the years to address resource conservations in various resource allocation networks (RANs).
Sheetal Jain +3 more
doaj +1 more source
Set Families with a Forbidden Subposet [PDF]
The Electronic Journal of Combinatorics, 2009 We asymptotically determine the size of the largest family $\cal F$ of subsets of $\{1,\dots,n\}$ not containing a given poset $P$ if the Hasse diagram of $P$ is a tree. This is a qualitative generalization of several known results including Sperner's theorem.
openaire +3 more sources
Independent sets in hypergraphs with a forbidden link [PDF]
Proceedings of the London Mathematical Society, 2021 We give a probabilistic construction of a $3$-uniform hypergraph on $N$ vertices with independence number $O(\log N / \log \log N)$ in which there are at most two edges among any four vertices. This bound is tight and solves a longstanding open problem of Erdős and Hajnal in Ramsey theory.
Fox, Jacob, He, Xiaoyu
openaire +2 more sources
Journal of Difference Equations and Applications, 2015 In recent literature there are an increasing number of papers where the forbidden sets of difference equations are computed. We review and complete different attempts to describe the forbidden set and propose new perspectives for further research and a list of open problems in this field.
Balibrea, Francisco, Cascales, Antonio
openaire +2 more sources
Compact Forbidden-Set Routing [PDF]
, 2007 We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V, a path is X-constrained if all intermediate vertices avoid X. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V, we can route on the shortest X-constrained path between x, y ∈ X.
Bruno Courcelle, Andrew Twigg
openaire +1 more source
Tree in forbidden triples generating a finite set of graphs with high connectivity
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph and a set of connected graphs, is said be -free if does not contain any member of as an induced subgraph. For , we let denote the set of all -connected -free graphs.
Yoshimi Egawa, Zhixian Zhao
doaj +1 more source
Set families with a forbidden pattern
European Journal of Combinatorics, 2017 15 ...
Ilan Karpas, Eoin Long
openaire +3 more sources
IEEE Access, 2020 The phenomenon of crossing the forbidden zone is unavoidable and wasteful when scheduling the hydro units. In this paper, the effect of crossing the forbidden zone is taken into account using the strategic offering model to help the price-maker hydro ...
Chen Zhang, Wei Yan
doaj +1 more source