ALL libraries (COBIB.SI union bibliographic/catalogue database)
-
Partition-crossing hypergraphsBujtás, Csilla ; Tuza, ZsoltFor a finite set ▫$X$▫, we say that a set ▫$H\subseteq X$▫ crosses a partition ▫$\mathcal P=(X_1,\dots,X_k)$▫ of ▫$X$▫ if ▫$H$▫ intersects ▫$\min(|H|, k)$▫ partition classes. If ▫$|H|\geq k$▫, this ... means that ▫$H$▫ meets all classes ▫$X_i$▫, whilst for ▫$|H|\leq k$▫ the elements of the crossing set ▫$H$▫ belong to mutually distinct classes. A set system ▫$\mathcal H$▫ crosses ▫$\mathcal P$▫, if so does some ▫$H \in\mathcal H$▫. The minimum number of ▫$r$▫-element subsets, such that every ▫$k$▫-partition of an ▫$n$▫-element set ▫$X$▫ is crossed by at least one of them, is denoted by ▫$f(n,k,r)$▫.The problem of determining these minimum values for ▫$k=r$▫ was raised and studied by several authors, first by Sterboul in 1973 [Proc. Colloq. Math. Soc. J. Bolyai, Vol. 10, Keszthely 1973, North-Holland/American Elsevier, 1975, pp. 1387-1404]. The present authors determined asymptotically tight estimates on ▫$f(n,k,k)$▫ for every fixed ▫$k$▫ as ▫$n\to\infty$▫ [Graphs Combin., 25 (2009), 807-816]. Here we consider the more general problem for two parameters ▫$k$▫ and ▫$r$▫, and establish lower and upper bounds for ▫$f(n,k,r)$▫. For various combinations of the three values ▫$n$▫, ▫$k$▫, ▫$r$▫ we obtain asymptotically tight estimates, and also point out close connections of the function ▫$f(n,k,r)$▫ to Turán-type extremal problems on graphs and hypergraphs, or to balanced incomplete block designs.Source: Acta cybernetica. - ISSN 0324-721X (Vol. 23, no. 3, 2018, str. 815-828)Type of material - article, component partPublish date - 2018Language - englishCOBISS.SI-ID - 18887513
Author
Bujtás, Csilla |
Tuza, Zsolt
Topics
partition |
set system |
crossing set |
Turán-type problem |
hypergraph |
upper chromatic number
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Bujtás, Csilla | 52672 |
Tuza, Zsolt | ![]() |
Source: Personal bibliographies
and: SICRIS
Select pickup location:
Material pickup by post
Delivery address:
Address is missing from the member's data.
The address retrieval service is currently unavailable, please try again.
By clicking the "OK" button, you will confirm the pickup location selected above and complete the reservation process.
By clicking the "OK" button, you will confirm the above pickup location and delivery address, and complete the reservation process.
By clicking the "OK" button, you will confirm the address selected above and complete the reservation process.
Notification
Automatic login and reservation service currently not available. You can reserve the material on the Biblos portal or try again here later.
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
Pickup location | Material status | Reservation |
---|
Reservation in progress
Please wait a moment.
Reservation was successful.
Reservation failed.
Reservation...
Membership card:
Pickup location: