TBSs in some minimum coverings

AbstractLet (X,B) be a (λKn,G)-covering with excess E and a blocking set T. Let Γ1, Γ2, …, Γs be all connected components of E with at least two vertices (note that s=0 if E=0̸). The blocking set T is called tight if further V(Γi)∩T≠0̸ and V(Γi)∩(X∖T)≠0̸ for 1≤i≤s. In this paper, we give a complete solution for the existence of a minimum (λKn,G)-covering admitting a blocking set (BS), or a tight blocking set (TBS) for any λ and when G=K3 and G=K3+e

Tight blocking sets in some maximum packings of λKn

AbstractLet (X,B) be a (λKn,G)-packing with edge-leave L and a blocking set T. Let Γ1,Γ2,…,Γs be all connected components of L with at least two vertices (note that s=0 if L=∅). The blocking set T is called tight if further V(Γi)∩T≠∅ and V(Γi)∩(X⧹T)≠∅ for 1⩽i⩽s. In this paper we give a complete solution for the existence of a maximum (λKn,G)-packing admitting a blocking set (BS), or a tight blocking set (TBS) for any λ, and G=K3, kite

LIPIcs, Volume 258, SoCG 2023, Complete Volume

LIPIcs, Volume 258, SoCG 2023, Complete Volum

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008