A graph is called H-free if it contains no copy of H. Denote by fn(H) the number of (labeled) H-free graphs on n vertices. Erdős conjectured that fn(H) ≤ 2(1+o(1)) ex(n,H). This was first shown to be true for cliques; then, Erdős, Frankl, and Rödl proved it for all graphs H with χ(H) ≥ 3. For most bipartite H, the question is still wide open, and even the correct order of magnitude of log2 fn(H...

For purposes of reacting to an increasingly competitive business environment, many companies emphasize the importance of knowledge management (KM), thus, it is a worthwhile project to explore and learn about KM features of high-performance companies. Discovering and describing the critical KM features of high-performance companies is a qualitative analysis problem. To handle this kind of proble...

There has been some confusion as to whether KM is part of BI or BI is part of KM. The lack of clarity is seen to be, in part, dependent on how the two concepts are defined. Their relationship is clarified. BI focuses on explicit knowledge, but KM encompasses both tacit and explicit knowledge. Both concepts promote learning, decision-making, and understanding. Yet, KM can influence the very natu...

In this paper we study the existence problem for KM-arcs in small Desarguesian planes. We establish a full classification of KMq,t-arcs for q 6 32, up to projective equivalence. We also construct a KM64,4-arc; as t = 4 was the only value for which the existence of a KM64,t-arc was unknown, this fully settles the existence problem for q 6 64.