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
b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture
Authors
Chang
Erdős
+10 more
Erdős
Erdős
Erdős
Hindman
Irving
Jackson
Kahn
Kratochvil
Linhares-Sales
Sánchez-Arroyo
Publication date
Publisher
'Elsevier BV'
Doi
Cite
Abstract
Abstract is not available.
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/01/2021