A fractional matching of a graph G is a function f giving each edge a number in [0, 1] so
that∑ e∈ Γ (v) f (e)≤ 1 for each vertex v∈ V (G), where Γ (v) is the set of edges incident to …

For an n-vertex graph G, a fractional matching of G is a function f giving each edge a real
number in [0, 1] such that∑ e∈ Γ (v) f (e)≤ 1 for each vertex v∈ V (G), where Γ (v) is the set …

ABSTRACT A fractional matching of a graph G is a function f giving each edge a number in
[0, 1] so that∑ e∈ Γ (v) f (e)≤ 1 for each v∈ V (G), where Γ (v) is the set of edges incident to …

An integer k-matching of a graph G is a function f that assigns to each edge an integer in {0,
1,…, k} such that∑ e∈ Γ (v) f (e)≤ k for each v∈ V (G). The k-matching number of G is the …

A major line of research is discovering Ramsey-type theorems, which are results of the
following form: given a graph parameter ρ, every graph G with sufficiently large ρ (G) …

The partition number π (K) of a simplicial complex K⊆ 2 [n] is the minimum integer k such
that for each partition A 1⊎…⊎ A k=[n] of [n] at least one of the sets A i is in K. A complex K is …

We consider the following problem: given a set of lines in a public transportation network
with their round trip times and frequencies, a maximum number of vehicles and a maximum …

A prevalência de H. pylori varia entre 85% e 95% nos países subdesenvolvidos pode variar
entre 30 e 50% nos países desenvolvidos. A presença da H. pylori é relacionada ao …

Public transport brings undisputed benefits to modern-day societies. Aside from providing an
affordable means to get around, its supreme efficiency in comparison with private transport …

The fractional matching number of a graph G, written as α′(G), is the maximum size of a
fractional matching of G. The following sharp lower bounds for a graph G of order n are …