BROWSE

Related Scientist

abhishek,methuku's photo.

abhishek,methuku
이산수학그룹
more info

ITEM VIEW & DOWNLOAD

Bipartite Turán Problems for Ordered Graphs

Cited 0 time in webofscience Cited 0 time in scopus
133 Viewed 0 Downloaded
Title
Bipartite Turán Problems for Ordered Graphs
Author(s)
Abhishek Methuku; Tomon, István
Publication Date
2022-12
Journal
Combinatorica, v.42, no.6, pp.895 - 911
Publisher
Springer Verlag
Abstract
A zero-one matrix M contains a zero-one matrix A if one can delete some rows and columns of M, and turn some 1-entries into 0-entries such that the resulting matrix is A. The extremal number of A, denoted by ex(n,A), is the maximum number of 1-entries in an n×n sized matrix M that does not contain A. A matrix A is column-t-partite (or row-t-partite), if it can be cut along the columns (or rows) into t submatrices such that every row (or column) of these submatrices contains at most one 1-entry. We prove that if A is column-t-partite, then ex(n,A)
URI
https://pr.ibs.re.kr/handle/8788114/13735
DOI
10.1007/s00493-021-4296-0
ISSN
0209-9683
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse