Results 231 to 240 of about 24,507 (264)

Forbidden k‐Sets in the Plane

SIAM Journal on Discrete Mathematics, 2007
Let $A$ be a set of nonnegative integers. We say that $A$ is skippable if there are arbitrary large finite sets of points in the plane, not contained in a line, that determine no $k$-edge for any $k \in A$. In this paper we show, by construction, that there are arbitrary large skippable sets.
Micha A. Perles, Rom Pinchasi
openaire   +1 more source

Forbidden Subgraphs Generating Almost the Same Sets

Combinatorics, Probability and Computing, 2013
Let$\mathcal{H}$be a set of connected graphs. A graphGis said to be$\mathcal{H}$-free ifGdoes not contain any element of$\mathcal{H}$as an induced subgraph. Let$\mathcal{F}_{k}(\mathcal{H})$be the set ofk-connected$\mathcal{H}$-free graphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow a finite ...
Shinya Fujita 0001, Michitaka Furuya, Kenta Ozeki   +2 more
openaire   +2 more sources

A Note on the Largest Size of Families of Sets with a Forbidden Poset

Order, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bin Chen, Wei-Tian Li
openaire   +1 more source

Forbidden-set distance labels for graphs of bounded doubling dimension

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, 2010
This article proposes a forbidden-set labeling scheme for the family of unweighted graphs with doubling dimension bounded by α. For an n -vertex graph G in this family, and for any desired precision parameter ϵ > 0, the labeling scheme stores an O (1 + ϵ
Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg   +3 more
openaire   +1 more source

Forbidden configurations for distributive and modular ordered sets

Order, 1989
Let A be an ordered set, \(a,b\in A\). Denote by L(a,b) (U(a,b)) the set of all lower (upper, respectively) bounds of a, b. A is called distributive whenever \(L(U(a,b),c)=L(U(L(a,c),L(b,c))\) for all a,b,c\(\in A\). A is called modular if \(a\leq c\) implies \(L(U(a,b),c)=L(U(a,L(b,c)))\) for all a,b,c\(\in A\).
Chajda, Ivan, Rachůnek, Jiří
openaire   +1 more source

Cycles with Prescribed and Forbidden Sets of Elements in Cubic Graphs

Graphs and Combinatorics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Compact forbidden-set routing

2006
We study the compact forbidden-set routing problem. We describe the first compact forbidden-set routing schemes that do not suffer from non-convergence problems often associated with Bellman-Ford iterative schemes such as the interdomain routing protocol, BGP.
openaire   +1 more source

Cycles Through Prescribed and Forbidden Point Sets

1982
A graph G has property C ( m + , n − ) if for any choice of m + n points u 1 ,…, u m , v 1 ,…, v n in G there is a cycle in G which includes all of u 1 ,…, u m , but none of v 1 ,…, v n . We discuss the family of implications ‘ C ( m + , n − )→ C ( r + , s − )’ for various non-negative integral values of m , n , r
D.A. Holton, M.D. Plummer
openaire   +1 more source

The Forbidden Set of

Journal of Difference Equations and Applications, 2003
E. Camouzis, R. DeVault
openaire   +1 more source

Forbidden symmetries, Cantor sets and hypothetical graphite

Chaos, Solitons & Fractals, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources