How to use most proportional in a sentence? Find typical usage patterns (collocations)/phrases/context for "most proportional" and check conjugation/comparative form for "most proportional". Mastering all the usages of "most proportional" from sentence examples published by news publications.
You know who gives the most, proportional to their income?
|
|
As a result, most proportional systems have at least three major parties, often more.
|
|
But a new map by artist and architect Hajime Narukawa offers what's possibly the most proportional map we've ever seen.
|
|
Beautiful symmetry: Here we have spiral galaxy NGC 2985, one of the most proportional spiral galaxies out there, as seen by the Hubble Space Telescope.
|
|
The cop-win graphs are the graphs with cop number equal to one. Every planar graph has cop number at most three. More generally, every graph has cop number at most proportional to its genus. However, the best known lower bound for the cop number in terms of the genus is approximately the square root of the genus, which is far from the upper bound when the genus is large.
|
|
A coloring of a given graph is distinguishing for that graph if and only if it is distinguishing for the complement graph. Therefore, every graph has the same distinguishing number as its complement. For every graph , the distinguishing number of is at most proportional to the logarithm of the number of automorphisms of . If the automorphisms form a nontrivial abelian group, the distinguishing number is two, and if it forms a dihedral group then the distinguishing number is at most three.
|
|
Most proportional representation systems do not yield precisely proportional outcomes due to the use of election thresholds, small electoral regions, or other implementation details that vary from one elected body to another. This article deals primarily with systems inherently designed to produce moderately proportional election results. The choice to use a semi-proportional electoral system may be a deliberate attempt to find a balance between single-party rule and proportional representation. Semi-proportional systems can allow for fairer representation of those parties that have difficulty gaining individual seats while retaining the possibility of one party gaining an overall majority when there is a landslide victory.
|
|
Separators have been used as part of data compression algorithms for representing planar graphs and other separable graphs using a small number of bits. The basic principle of these algorithms is to choose a number k and repeatedly subdivide the given planar graph using separators into O(n/k) subgraphs of size at most k, with O(n/√k) vertices in the separators. With an appropriate choice of k (at most proportional to the logarithm of n) the number of non-isomorphic k-vertex planar subgraphs is significantly less than the number of subgraphs in the decomposition, so the graph can be compressed by constructing a table of all the possible non-isomorphic subgraphs and representing each subgraph in the separator decomposition by its index into the table. The remainder of the graph, formed by the separator vertices, may be represented explicitly or by using a recursive version of the same data structure.
|
|
100; , Corollary 24, p.10. Since outerplanar graphs, series- parallel graphs, and Halin graphs all have bounded treewidth, they all also have at most logarithmic pathwidth. As well as its relations to treewidth, pathwidth is also related to clique-width and cutwidth, via line graphs; the line graph L(G) of a graph G has a vertex for each edge of G and two vertices in L(G) are adjacent when the corresponding two edges of G share an endpoint. Any family of graphs has bounded pathwidth if and only if its line graphs have bounded linear clique-width, where linear clique-width replaces the disjoint union operation from clique-width with the operation of adjoining a single new vertex.. If a connected graph with three or more vertices has maximum degree three, then its cutwidth equals the vertex separation number of its line graph.. In any planar graph, the pathwidth is at most proportional to the square root of the number of vertices.
|
|
No results under this filter, show 9 sentences.