Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Extremal K_(s,t)-fre ...
Article

Extremal K_(s,t)-free bipartite graphs

Camino Balbuena ORCID (1), P. García-Vázquez (2) (3), Xavier Marcote (1), J. C. Valenzuela (4)
(1) Departamento de Matemática Aplicada III [Barcelona]
(2) Departamento de Matemática Aplicada I
(3) Departamento de Matemática Aplicada I [Universidad de Sevilla]
(4) Departamento de Matemàticas
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2008
Last modified on
March 31, 2025
Volume 10
vol. 10:3
Graph and Algorithms
DOI
10.46298/dmtcs.435
License
https://about.hal.science/hal-authorisation-v1
Indicators
842
Views
2483
Downloads

Extremal K_(s,t)-free bipartite graphs

Camino Balbuena ORCID (1), P. García-Vázquez (2) (3), Xavier Marcote (1), J. C. Valenzuela (4)
(1) Departamento de Matemática Aplicada III [Barcelona]
(2) Departamento de Matemática Aplicada I
(3) Departamento de Matemática Aplicada I [Universidad de Sevilla]
(4) Departamento de Matemàticas
Abstract
In this paper new exact values of the Zarankiewicz function z(m,n;s,t) are obtained assuming certain requirements on the parameters. Moreover, all the corresponding extremal graphs are characterized. Finally, an extension of this problem to 3-partite graphs is studied.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Preview
Loading PDF preview...