Results 71 to 80 of about 59,275 (246)
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner +2 more
wiley +1 more source
Subgraph Queries by Context-free Grammars
Journal of Integrative Bioinformatics, 2008 We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two ...
Sevon Petteri, Eronen Lauri
doaj +1 more source
On induced subgraphs with odd degrees
Discrete Mathematics, 1994 The author proves that every graph \(G\) on \(n\) vertices with no isolated vertices contains an induced subgraph \(H\) such that every vertex in \(H\) has odd degree in \(H\) and \(| V(H) | \geq (1-o(1))\sqrt {n/6}\).
openaire +3 more sources
Oikos, EarlyView.Self‐organised pattern formation creates heterogeneous growth conditions in spatially extended ecosystems and can support local functional diversity in metacommunities – sets of communities linked by dispersal. However, the mechanisms connecting emergent heterogeneity on the metacommunity scale and diversity on the local scale, and how they depend on ...
Louica Philipp +2 more
wiley +1 more source
Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
, 2015 We present an efficient algorithm for solving local linear systems with a boundary condition using the Green's function of a connected induced subgraph related to the system.
Chung, Fan, Simpson, Olivia
core +1 more source
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT This study develops a solution to the distributed SE(d)$$ \mathrm{SE}(d) $$ formation control problem of multi‐agent systems using only relative measurements between agents. In this problem, poses, that is, orientations and positions, of the agents are expected to achieve desired ones.
Chunlai Peng +4 more
wiley +1 more source
Small Science, EarlyView.ClusterNet is a graph‐based deep learning pipeline for classifying single‐molecule localization microscopy (SMLM) data. It acts directly on point‐cloud localization data from a field of view of any size, using features of individual clusters of localizations together with their spatial arrangement.
Oliver Umney +5 more
wiley +1 more source
A note on the minimum rank of graphs with given dominating induced subgraph
The American Journal of CombinatoricsAn induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj +1 more source
On The Number of Distinct Induced Subgraphs of a Graph
Discrete Mathematics, 1989 Let \(i(G)\) be the number of pairwise non-isomorphic induced subgraphs of graph \(G=\). The graph \(G=\) is \(\ell\)-canonical if there is a partition \(0\) such that for all \(n\) and for all \(G\) with \(n\) vertices \(i(G)\leq \delta n^{k+1}\) it follows that these exists a \(W\subset V\), \(|W| \leq \epsilon n\), such that \(G[V\setminus W]\) is \(
Andras Hajnal, Paul Erdös
openaire +3 more sources