skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs
Award ID(s):
1954170
PAR ID:
10335791
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of Graph Theory
Volume:
100
Issue:
4
ISSN:
0364-9024
Page Range / eLocation ID:
721 to 726
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Combinatorica)
    null (Ed.)
  2. ; ; ; (, SIAM Journal on Discrete Mathematics)
  3. ; (, Journal of graph theory)
    We study two biased Maker-Breaker games played on the complete digraph $$\vec{K}_n$$. In the strong connectivity game, Maker wants to build a strongly connected subgraph. We determine the asymptotic optimal bias for this game viz. $$\frac{n}{\log n}$$. In the Hamiltonian game, Maker wants to build a Hamiltonian subgraph. We determine the asymptotic optimal bias for this game up to a constant factor. 
    more » « less
  4. ; ; (, Israel Journal of Mathematics)
  5. ; ; ; ; (, SIAM Journal on Discrete Mathematics)
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email