Abstract
Given a finite graph G=( V, E), what is the minimum number c( G) of incidence tests which are needed in the worst case to identify an unknown edge e* ϵE? The number c( G) was first studied by Aigner and Triesch (1988), where it was shown that for almost all graphs in the random graph model G(n, P( edge)=p), 0<p<1 fixed, c( G)⩾ n− d( n), where d( n)=(2log n/log(1/1− p))+ O(loglog n). We prove that for each η< 1 2 , almost all graphs satisfy c( G)⩽ n− ηd( n).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
