Given a graph H and a set of graphs F, let ex(n, H, F) denote the maximum possible number of copies of H in an T-free graph on n vertices. We investigate the function ex(n, H, F), when H and members of F are cycles. Let C-k denote the cycle of length k and ...
Purpose This paper aims to discuss the nexus between two societal (sub) systems of housing and energy supply to shed new light on the key institutional barriers to socio-technical energy transition in the built environment. The key research question is to ...
A subfamily {F-1, F-2, ..., F-vertical bar P vertical bar} subset of F is a copy of the poset P if there exists a bijection i : P -> {F-1, F-2, ..., F-vertical bar P vertical bar}, such that p
In the first part of this paper, we propose a uniform interpretation of characteristic classes as obstructions to the reduction of the structure group and to the existence of an equivariant extension of a certain homomorphism defined a priori only on a sin ...
A family of subsets of {1, ... , n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdos, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1, ... , n}. In this ...
Tuberculosis (TB), whose etiological agent is Mycobacterium tuberculosis (M. tuberculosis), has plagued humanity since antiquity. Even with chemotherapy available today, TB is the leading cause of death due to an infectious disease. Modern day factors, suc ...