Extremal K-(s,K-t)-free bipartite graphs

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.

Detalles Bibliográficos
Autores: Balbuena, Camino, García Vázquez, Pedro, Marcote Ordax, Xavier, Valenzuela Tripodoro, Juan Carlos
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2008
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/154762
Acceso en línea:https://hdl.handle.net/11441/154762
https://doi.org/10.46298/dmtcs.435
Access Level:acceso abierto
Palabra clave:Zarankiewicz problem
Extremal graph theory
Forbidden subgraphs
id ES_086a657dd00fc4911bc0ec05836cf3ce
oai_identifier_str oai:idus.us.es:11441/154762
network_acronym_str ES
network_name_str España
repository_id_str
spelling Extremal K-(s,K-t)-free bipartite graphsBalbuena, CaminoGarcía Vázquez, PedroMarcote Ordax, XavierValenzuela Tripodoro, Juan CarlosZarankiewicz problemExtremal graph theoryForbidden subgraphsIn 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.Association DMTCSMatemática Aplicada IFQM240: Invariantes en Teoría de Grafos y OptimizaciónMinisterio de Educación y Ciencia (MEC). EspañaEuropean Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER)Junta de Andalucía2008info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/154762https://doi.org/10.46298/dmtcs.435reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésDiscrete Mathematics & Theoretical Computer Science (DMTCS), 10 (3), 35-48.MTM2005-08990-C02-02P06-FQM-01649https://dmtcs.episciences.org/435/pdfinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/1547622026-06-17T12:51:07Z
dc.title.none.fl_str_mv Extremal K-(s,K-t)-free bipartite graphs
title Extremal K-(s,K-t)-free bipartite graphs
spellingShingle Extremal K-(s,K-t)-free bipartite graphs
Balbuena, Camino
Zarankiewicz problem
Extremal graph theory
Forbidden subgraphs
title_short Extremal K-(s,K-t)-free bipartite graphs
title_full Extremal K-(s,K-t)-free bipartite graphs
title_fullStr Extremal K-(s,K-t)-free bipartite graphs
title_full_unstemmed Extremal K-(s,K-t)-free bipartite graphs
title_sort Extremal K-(s,K-t)-free bipartite graphs
dc.creator.none.fl_str_mv Balbuena, Camino
García Vázquez, Pedro
Marcote Ordax, Xavier
Valenzuela Tripodoro, Juan Carlos
author Balbuena, Camino
author_facet Balbuena, Camino
García Vázquez, Pedro
Marcote Ordax, Xavier
Valenzuela Tripodoro, Juan Carlos
author_role author
author2 García Vázquez, Pedro
Marcote Ordax, Xavier
Valenzuela Tripodoro, Juan Carlos
author2_role author
author
author
dc.contributor.none.fl_str_mv Matemática Aplicada I
FQM240: Invariantes en Teoría de Grafos y Optimización
Ministerio de Educación y Ciencia (MEC). España
European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER)
Junta de Andalucía
dc.subject.none.fl_str_mv Zarankiewicz problem
Extremal graph theory
Forbidden subgraphs
topic Zarankiewicz problem
Extremal graph theory
Forbidden subgraphs
description 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.
publishDate 2008
dc.date.none.fl_str_mv 2008
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/154762
https://doi.org/10.46298/dmtcs.435
url https://hdl.handle.net/11441/154762
https://doi.org/10.46298/dmtcs.435
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Discrete Mathematics & Theoretical Computer Science (DMTCS), 10 (3), 35-48.
MTM2005-08990-C02-02
P06-FQM-01649
https://dmtcs.episciences.org/435/pdf
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Association DMTCS
publisher.none.fl_str_mv Association DMTCS
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403041291042816
score 15,300724

Similares en LA Referencia