CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Transversals via regularity
Authors
Yangyang Cheng
Katherine Staden
Publication date
6 June 2023
Publisher
View
on
arXiv
Abstract
Given graphs
G
1
,
β¦
,
G
s
G_1,\ldots,G_s
G
1
β
,
β¦
,
G
s
β
all on the same vertex set and a graph
H
H
H
with
e
(
H
)
β€
s
e(H) \leq s
e
(
H
)
β€
s
, a copy of
H
H
H
is transversal or rainbow if it contains at most one edge from each
G
c
G_c
G
c
β
. When
s
=
e
(
H
)
s=e(H)
s
=
e
(
H
)
, such a copy contains exactly one edge from each
G
i
G_i
G
i
β
. We study the case when
H
H
H
is spanning and explore how the regularity blow-up method, that has been so successful in the uncoloured setting, can be used to find transversals. We provide the analogues of the tools required to apply this method in the transversal setting. Our main result is a blow-up lemma for transversals that applies to separable bounded degree graphs
H
H
H
. Our proofs use weak regularity in the
3
3
3
-uniform hypergraph whose edges are those
x
y
c
xyc
x
yc
where
x
y
xy
x
y
is an edge in the graph
G
c
G_c
G
c
β
. We apply our lemma to give a large class of spanning
3
3
3
-uniform linear hypergraphs
H
H
H
such that any sufficiently large uniformly dense
n
n
n
-vertex
3
3
3
-uniform hypergraph with minimum vertex degree
Ξ©
(
n
2
)
\Omega(n^2)
Ξ©
(
n
2
)
contains
H
H
H
as a subhypergraph. This extends work of Lenz, Mubayi and Mycroft
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2306.03595
Last time updated on 08/06/2023