"Minimizing the number of complete bipartite graphs in a ..."

Beka Ergemlidze et al. (2023)

> Home

Details and statistics

DOI: 10.7151/DMGT.2402

access: open

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/ErgemlidzeMTT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/ErgemlidzeMTT23
Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a K_s-saturated graph. Discuss. Math. Graph Theory 43(3): 793-807 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.